./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/ldv-regression/ex3_forlist.i -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 78f95c70d702e3726c098ef8eec3c10bcd690c4e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 02:08:53,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 02:08:53,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 02:08:53,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 02:08:53,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 02:08:53,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 02:08:53,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 02:08:53,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 02:08:53,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 02:08:53,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 02:08:53,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 02:08:53,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 02:08:53,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 02:08:53,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 02:08:53,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 02:08:53,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 02:08:53,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 02:08:53,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 02:08:53,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 02:08:53,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 02:08:53,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 02:08:53,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 02:08:53,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 02:08:53,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 02:08:53,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 02:08:53,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 02:08:53,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 02:08:53,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 02:08:53,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 02:08:53,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 02:08:53,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 02:08:53,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 02:08:53,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 02:08:53,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 02:08:53,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 02:08:53,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 02:08:53,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 02:08:53,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 02:08:53,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 02:08:53,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 02:08:53,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 02:08:53,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 02:08:53,986 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 02:08:53,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 02:08:53,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 02:08:53,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 02:08:53,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 02:08:53,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 02:08:53,990 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 02:08:53,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 02:08:53,990 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 02:08:53,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 02:08:53,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 02:08:53,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 02:08:53,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 02:08:53,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 02:08:53,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 02:08:53,993 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 02:08:53,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 02:08:53,993 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 02:08:53,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 02:08:53,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 02:08:53,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 02:08:53,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 02:08:53,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:08:53,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 02:08:53,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 02:08:53,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 02:08:53,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 02:08:53,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 02:08:53,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 02:08:53,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 02:08:53,995 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 -> 78f95c70d702e3726c098ef8eec3c10bcd690c4e [2021-08-26 02:08:54,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 02:08:54,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 02:08:54,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 02:08:54,341 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 02:08:54,342 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 02:08:54,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-08-26 02:08:54,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15053ca0e/3e7592fdfaf64d0c9893bd1b3e521bf7/FLAGbff14c6ec [2021-08-26 02:08:54,809 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 02:08:54,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-08-26 02:08:54,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15053ca0e/3e7592fdfaf64d0c9893bd1b3e521bf7/FLAGbff14c6ec [2021-08-26 02:08:55,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15053ca0e/3e7592fdfaf64d0c9893bd1b3e521bf7 [2021-08-26 02:08:55,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 02:08:55,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 02:08:55,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 02:08:55,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 02:08:55,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 02:08:55,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c653662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55, skipping insertion in model container [2021-08-26 02:08:55,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 02:08:55,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 02:08:55,322 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-08-26 02:08:55,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:08:55,353 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 02:08:55,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-08-26 02:08:55,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:08:55,403 INFO L208 MainTranslator]: Completed translation [2021-08-26 02:08:55,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55 WrapperNode [2021-08-26 02:08:55,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 02:08:55,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 02:08:55,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 02:08:55,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 02:08:55,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 02:08:55,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 02:08:55,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 02:08:55,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 02:08:55,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 02:08:55,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 02:08:55,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 02:08:55,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 02:08:55,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (1/1) ... [2021-08-26 02:08:55,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:08:55,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:08:55,495 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) [2021-08-26 02:08:55,503 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 [2021-08-26 02:08:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-26 02:08:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-26 02:08:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 02:08:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 02:08:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 02:08:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 02:08:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 02:08:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 02:08:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 02:08:56,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 02:08:56,019 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-08-26 02:08:56,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:08:56 BoogieIcfgContainer [2021-08-26 02:08:56,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 02:08:56,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 02:08:56,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 02:08:56,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 02:08:56,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:08:55" (1/3) ... [2021-08-26 02:08:56,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c01239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:08:56, skipping insertion in model container [2021-08-26 02:08:56,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:08:55" (2/3) ... [2021-08-26 02:08:56,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c01239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:08:56, skipping insertion in model container [2021-08-26 02:08:56,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:08:56" (3/3) ... [2021-08-26 02:08:56,028 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2021-08-26 02:08:56,037 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 02:08:56,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 02:08:56,079 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 02:08:56,084 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 02:08:56,085 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-26 02:08:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 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) [2021-08-26 02:08:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 02:08:56,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:08:56,102 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:08:56,103 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:08:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:08:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 409945024, now seen corresponding path program 1 times [2021-08-26 02:08:56,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:08:56,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775417278] [2021-08-26 02:08:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:56,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:08:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:08:56,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:08:56,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775417278] [2021-08-26 02:08:56,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775417278] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:08:56,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:08:56,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:08:56,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277702866] [2021-08-26 02:08:56,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:08:56,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:08:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:08:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:08:56,278 INFO L87 Difference]: Start difference. First operand has 35 states, 32 states have (on average 1.59375) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-08-26 02:08:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:08:56,305 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2021-08-26 02:08:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:08:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2021-08-26 02:08:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:08:56,314 INFO L225 Difference]: With dead ends: 68 [2021-08-26 02:08:56,314 INFO L226 Difference]: Without dead ends: 33 [2021-08-26 02:08:56,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:08:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-08-26 02:08:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-08-26 02:08:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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) [2021-08-26 02:08:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-08-26 02:08:56,344 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2021-08-26 02:08:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:08:56,345 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-08-26 02:08:56,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-08-26 02:08:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-08-26 02:08:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 02:08:56,346 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:08:56,346 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:08:56,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 02:08:56,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:08:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:08:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1658708759, now seen corresponding path program 1 times [2021-08-26 02:08:56,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:08:56,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153475386] [2021-08-26 02:08:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:56,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:08:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:08:56,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:08:56,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153475386] [2021-08-26 02:08:56,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153475386] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:08:56,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757576925] [2021-08-26 02:08:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:56,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:08:56,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:08:56,425 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) [2021-08-26 02:08:56,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 02:08:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:56,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 02:08:56,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:08:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 02:08:56,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757576925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:08:56,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 02:08:56,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-26 02:08:56,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534766201] [2021-08-26 02:08:56,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:08:56,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:08:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:08:56,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:08:56,567 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2021-08-26 02:08:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:08:56,596 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2021-08-26 02:08:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:08:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2021-08-26 02:08:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:08:56,598 INFO L225 Difference]: With dead ends: 75 [2021-08-26 02:08:56,598 INFO L226 Difference]: Without dead ends: 55 [2021-08-26 02:08:56,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:08:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-08-26 02:08:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2021-08-26 02:08:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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) [2021-08-26 02:08:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-08-26 02:08:56,604 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2021-08-26 02:08:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:08:56,604 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-08-26 02:08:56,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2021-08-26 02:08:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2021-08-26 02:08:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 02:08:56,605 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:08:56,605 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:08:56,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 02:08:56,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:08:56,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:08:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:08:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1382422530, now seen corresponding path program 1 times [2021-08-26 02:08:56,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:08:56,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878858753] [2021-08-26 02:08:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:56,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:08:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:08:56,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:08:56,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878858753] [2021-08-26 02:08:56,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878858753] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:08:56,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658395170] [2021-08-26 02:08:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:56,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:08:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:08:56,893 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) [2021-08-26 02:08:56,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 02:08:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:56,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 02:08:56,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:08:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:08:57,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658395170] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:08:57,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:08:57,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 02:08:57,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989445056] [2021-08-26 02:08:57,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:08:57,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:08:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:08:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:08:57,086 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-26 02:08:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:08:57,117 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2021-08-26 02:08:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:08:57,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 19 [2021-08-26 02:08:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:08:57,120 INFO L225 Difference]: With dead ends: 65 [2021-08-26 02:08:57,120 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 02:08:57,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:08:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 02:08:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-08-26 02:08:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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) [2021-08-26 02:08:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-08-26 02:08:57,131 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2021-08-26 02:08:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:08:57,131 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-08-26 02:08:57,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-26 02:08:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-08-26 02:08:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 02:08:57,133 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:08:57,133 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:08:57,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-26 02:08:57,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-08-26 02:08:57,340 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:08:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:08:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1994936256, now seen corresponding path program 2 times [2021-08-26 02:08:57,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:08:57,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608109434] [2021-08-26 02:08:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:57,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:08:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:08:57,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:08:57,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608109434] [2021-08-26 02:08:57,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608109434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:08:57,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:08:57,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 02:08:57,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291518896] [2021-08-26 02:08:57,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 02:08:57,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:08:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 02:08:57,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-26 02:08:57,772 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2021-08-26 02:08:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:08:58,035 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2021-08-26 02:08:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 02:08:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) Word has length 21 [2021-08-26 02:08:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:08:58,038 INFO L225 Difference]: With dead ends: 77 [2021-08-26 02:08:58,038 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 02:08:58,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 185.0ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-08-26 02:08:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 02:08:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2021-08-26 02:08:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 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) [2021-08-26 02:08:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-08-26 02:08:58,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2021-08-26 02:08:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:08:58,049 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-26 02:08:58,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2021-08-26 02:08:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2021-08-26 02:08:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 02:08:58,052 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:08:58,052 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:08:58,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 02:08:58,052 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:08:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:08:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 902320519, now seen corresponding path program 1 times [2021-08-26 02:08:58,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:08:58,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643973831] [2021-08-26 02:08:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:58,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:08:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:08:58,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:08:58,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643973831] [2021-08-26 02:08:58,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643973831] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:08:58,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414117736] [2021-08-26 02:08:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:58,121 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:08:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:08:58,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:08:58,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 02:08:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:58,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 02:08:58,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:08:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:08:58,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414117736] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:08:58,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:08:58,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 02:08:58,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102397748] [2021-08-26 02:08:58,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:08:58,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:08:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:08:58,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:08:58,268 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-08-26 02:08:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:08:58,315 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2021-08-26 02:08:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:08:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 23 [2021-08-26 02:08:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:08:58,319 INFO L225 Difference]: With dead ends: 99 [2021-08-26 02:08:58,319 INFO L226 Difference]: Without dead ends: 78 [2021-08-26 02:08:58,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:08:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-26 02:08:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2021-08-26 02:08:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 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) [2021-08-26 02:08:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2021-08-26 02:08:58,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2021-08-26 02:08:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:08:58,334 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2021-08-26 02:08:58,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-08-26 02:08:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2021-08-26 02:08:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 02:08:58,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:08:58,335 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:08:58,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 02:08:58,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:08:58,557 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:08:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:08:58,557 INFO L82 PathProgramCache]: Analyzing trace with hash -554343156, now seen corresponding path program 1 times [2021-08-26 02:08:58,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:08:58,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008508708] [2021-08-26 02:08:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:58,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:08:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:08:58,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:08:58,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008508708] [2021-08-26 02:08:58,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008508708] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:08:58,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541161462] [2021-08-26 02:08:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:08:58,869 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:08:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:08:58,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:08:58,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 02:08:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:08:58,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 02:08:58,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:08:59,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 45 [2021-08-26 02:08:59,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-26 02:08:59,369 INFO L354 Elim1Store]: treesize reduction 106, result has 15.2 percent of original size [2021-08-26 02:08:59,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 40 [2021-08-26 02:09:00,155 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-26 02:09:00,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 22 [2021-08-26 02:09:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:09:00,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541161462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:00,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 02:09:00,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2021-08-26 02:09:00,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975170868] [2021-08-26 02:09:00,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 02:09:00,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 02:09:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=155, Unknown=2, NotChecked=0, Total=210 [2021-08-26 02:09:00,166 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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) [2021-08-26 02:09:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:02,314 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2021-08-26 02:09:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 02:09:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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) Word has length 24 [2021-08-26 02:09:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:02,316 INFO L225 Difference]: With dead ends: 133 [2021-08-26 02:09:02,316 INFO L226 Difference]: Without dead ends: 123 [2021-08-26 02:09:02,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 973.4ms TimeCoverageRelationStatistics Valid=140, Invalid=364, Unknown=2, NotChecked=0, Total=506 [2021-08-26 02:09:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-26 02:09:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 61. [2021-08-26 02:09:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.305084745762712) internal successors, (77), 60 states have internal predecessors, (77), 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) [2021-08-26 02:09:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2021-08-26 02:09:02,325 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2021-08-26 02:09:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:02,325 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2021-08-26 02:09:02,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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) [2021-08-26 02:09:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2021-08-26 02:09:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 02:09:02,327 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:02,327 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:02,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-26 02:09:02,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:02,545 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash 964936531, now seen corresponding path program 1 times [2021-08-26 02:09:02,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:02,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570909562] [2021-08-26 02:09:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:02,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 02:09:02,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:02,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570909562] [2021-08-26 02:09:02,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570909562] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:02,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:02,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 02:09:02,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562258388] [2021-08-26 02:09:02,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 02:09:02,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 02:09:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 02:09:02,660 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-08-26 02:09:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:02,917 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2021-08-26 02:09:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 02:09:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 24 [2021-08-26 02:09:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:02,918 INFO L225 Difference]: With dead ends: 138 [2021-08-26 02:09:02,918 INFO L226 Difference]: Without dead ends: 128 [2021-08-26 02:09:02,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 130.7ms TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-08-26 02:09:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-26 02:09:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 61. [2021-08-26 02:09:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.305084745762712) internal successors, (77), 60 states have internal predecessors, (77), 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) [2021-08-26 02:09:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2021-08-26 02:09:02,926 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2021-08-26 02:09:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:02,926 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2021-08-26 02:09:02,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-08-26 02:09:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2021-08-26 02:09:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 02:09:02,927 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:02,927 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:02,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 02:09:02,927 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash 93482631, now seen corresponding path program 1 times [2021-08-26 02:09:02,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:02,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227242422] [2021-08-26 02:09:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:02,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:09:03,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:03,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227242422] [2021-08-26 02:09:03,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227242422] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:03,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531092546] [2021-08-26 02:09:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:03,179 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:03,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:03,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:09:03,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 02:09:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:03,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 02:09:03,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:09:03,410 INFO L388 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 13 treesize of output 9 [2021-08-26 02:09:03,490 INFO L388 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 19 treesize of output 7 [2021-08-26 02:09:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:09:03,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531092546] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:03,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:09:03,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-08-26 02:09:03,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131737786] [2021-08-26 02:09:03,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 02:09:03,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 02:09:03,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-26 02:09:03,501 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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) [2021-08-26 02:09:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:04,620 INFO L93 Difference]: Finished difference Result 228 states and 293 transitions. [2021-08-26 02:09:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-26 02:09:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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) Word has length 27 [2021-08-26 02:09:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:04,622 INFO L225 Difference]: With dead ends: 228 [2021-08-26 02:09:04,622 INFO L226 Difference]: Without dead ends: 214 [2021-08-26 02:09:04,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 745.2ms TimeCoverageRelationStatistics Valid=329, Invalid=1311, Unknown=0, NotChecked=0, Total=1640 [2021-08-26 02:09:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-08-26 02:09:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 100. [2021-08-26 02:09:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 99 states have internal predecessors, (130), 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) [2021-08-26 02:09:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2021-08-26 02:09:04,633 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 27 [2021-08-26 02:09:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:04,634 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2021-08-26 02:09:04,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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) [2021-08-26 02:09:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2021-08-26 02:09:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 02:09:04,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:04,635 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:04,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 02:09:04,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:04,849 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:04,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:04,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2029788007, now seen corresponding path program 1 times [2021-08-26 02:09:04,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:04,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346219457] [2021-08-26 02:09:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:04,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 02:09:05,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:05,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346219457] [2021-08-26 02:09:05,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346219457] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:05,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855303737] [2021-08-26 02:09:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:05,157 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:05,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:09:05,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 02:09:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:05,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-26 02:09:05,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:09:05,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 92 treesize of output 88 [2021-08-26 02:09:05,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-08-26 02:09:05,464 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-26 02:09:05,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2021-08-26 02:09:06,023 INFO L354 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2021-08-26 02:09:06,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2021-08-26 02:09:06,290 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-26 02:09:06,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 29 [2021-08-26 02:09:06,345 INFO L388 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 15 treesize of output 7 [2021-08-26 02:09:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:06,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855303737] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:06,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:09:06,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 23 [2021-08-26 02:09:06,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920352288] [2021-08-26 02:09:06,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-26 02:09:06,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-26 02:09:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-08-26 02:09:06,369 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 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) [2021-08-26 02:09:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:07,385 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2021-08-26 02:09:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 02:09:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 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) Word has length 27 [2021-08-26 02:09:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:07,386 INFO L225 Difference]: With dead ends: 153 [2021-08-26 02:09:07,386 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 02:09:07,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1268.9ms TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2021-08-26 02:09:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 02:09:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 02:09:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 73 states have internal predecessors, (93), 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) [2021-08-26 02:09:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2021-08-26 02:09:07,394 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 27 [2021-08-26 02:09:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:07,394 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2021-08-26 02:09:07,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 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) [2021-08-26 02:09:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2021-08-26 02:09:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-26 02:09:07,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:07,395 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:07,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 02:09:07,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:07,617 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1064810912, now seen corresponding path program 1 times [2021-08-26 02:09:07,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:07,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852640941] [2021-08-26 02:09:07,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:07,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 02:09:07,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:07,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852640941] [2021-08-26 02:09:07,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852640941] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:07,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841094864] [2021-08-26 02:09:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:07,840 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:07,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:09:07,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 02:09:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:08,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-26 02:09:08,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:09:08,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 307 treesize of output 291 [2021-08-26 02:09:08,285 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-26 02:09:08,285 INFO L388 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 1 case distinctions, treesize of input 67 treesize of output 43 [2021-08-26 02:09:08,307 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-26 02:09:08,308 INFO L388 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 1 case distinctions, treesize of input 43 treesize of output 19 [2021-08-26 02:09:08,569 INFO L388 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 36 treesize of output 24 [2021-08-26 02:09:08,572 INFO L388 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 21 treesize of output 13 [2021-08-26 02:09:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-26 02:09:08,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841094864] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:08,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:09:08,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2021-08-26 02:09:08,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231851482] [2021-08-26 02:09:08,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 02:09:08,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 02:09:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-08-26 02:09:08,609 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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) [2021-08-26 02:09:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:09,303 INFO L93 Difference]: Finished difference Result 110 states and 139 transitions. [2021-08-26 02:09:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 02:09:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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) Word has length 29 [2021-08-26 02:09:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:09,304 INFO L225 Difference]: With dead ends: 110 [2021-08-26 02:09:09,304 INFO L226 Difference]: Without dead ends: 54 [2021-08-26 02:09:09,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 686.7ms TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 02:09:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-26 02:09:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-08-26 02:09:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 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) [2021-08-26 02:09:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2021-08-26 02:09:09,325 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 29 [2021-08-26 02:09:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:09,326 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-08-26 02:09:09,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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) [2021-08-26 02:09:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-08-26 02:09:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 02:09:09,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:09,329 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-08-26 02:09:09,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 02:09:09,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:09,530 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 591619839, now seen corresponding path program 1 times [2021-08-26 02:09:09,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:09,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523665937] [2021-08-26 02:09:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:09,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 02:09:10,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:10,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523665937] [2021-08-26 02:09:10,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523665937] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:10,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492567324] [2021-08-26 02:09:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:10,044 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:10,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:10,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:09:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 02:09:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:10,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-26 02:09:10,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:09:10,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 395 treesize of output 387 [2021-08-26 02:09:10,883 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-26 02:09:10,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-08-26 02:09:11,016 INFO L388 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 23 treesize of output 15 [2021-08-26 02:09:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 02:09:11,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492567324] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:11,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:09:11,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2021-08-26 02:09:11,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326730017] [2021-08-26 02:09:11,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 02:09:11,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:11,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 02:09:11,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-08-26 02:09:11,040 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 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) [2021-08-26 02:09:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:11,498 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-08-26 02:09:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 02:09:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 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) Word has length 34 [2021-08-26 02:09:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:11,499 INFO L225 Difference]: With dead ends: 69 [2021-08-26 02:09:11,500 INFO L226 Difference]: Without dead ends: 56 [2021-08-26 02:09:11,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 533.8ms TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2021-08-26 02:09:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-08-26 02:09:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-08-26 02:09:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 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) [2021-08-26 02:09:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2021-08-26 02:09:11,511 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 34 [2021-08-26 02:09:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:11,511 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2021-08-26 02:09:11,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 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) [2021-08-26 02:09:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2021-08-26 02:09:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 02:09:11,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:11,513 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:11,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 02:09:11,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-26 02:09:11,721 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:11,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2098228492, now seen corresponding path program 1 times [2021-08-26 02:09:11,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:11,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663924976] [2021-08-26 02:09:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:11,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 02:09:11,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:11,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663924976] [2021-08-26 02:09:11,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663924976] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:11,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702290825] [2021-08-26 02:09:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:11,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:11,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:11,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:09:11,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 02:09:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:12,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 02:09:12,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:09:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 02:09:12,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702290825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:12,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 02:09:12,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-08-26 02:09:12,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901761359] [2021-08-26 02:09:12,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:09:12,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:09:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:09:12,176 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2021-08-26 02:09:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:12,205 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-08-26 02:09:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 02:09:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) Word has length 34 [2021-08-26 02:09:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:12,207 INFO L225 Difference]: With dead ends: 82 [2021-08-26 02:09:12,207 INFO L226 Difference]: Without dead ends: 40 [2021-08-26 02:09:12,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:09:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-26 02:09:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-26 02:09:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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) [2021-08-26 02:09:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2021-08-26 02:09:12,211 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 34 [2021-08-26 02:09:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:12,211 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2021-08-26 02:09:12,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2021-08-26 02:09:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2021-08-26 02:09:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 02:09:12,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:12,212 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:12,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 02:09:12,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:12,434 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:09:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1631106707, now seen corresponding path program 1 times [2021-08-26 02:09:12,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:12,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444937814] [2021-08-26 02:09:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:12,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 02:09:13,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:13,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444937814] [2021-08-26 02:09:13,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444937814] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:13,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208076757] [2021-08-26 02:09:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:13,158 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:09:13,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:13,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:09:13,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 02:09:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:13,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-26 02:09:13,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:09:13,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 402 treesize of output 394 [2021-08-26 02:09:13,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2021-08-26 02:09:14,005 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-08-26 02:09:14,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2021-08-26 02:09:14,078 INFO L388 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 19 treesize of output 7 [2021-08-26 02:09:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 02:09:14,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208076757] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:09:14,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:09:14,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2021-08-26 02:09:14,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704516033] [2021-08-26 02:09:14,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-26 02:09:14,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-26 02:09:14,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2021-08-26 02:09:14,143 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 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) [2021-08-26 02:09:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:14,690 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2021-08-26 02:09:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 02:09:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 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) Word has length 39 [2021-08-26 02:09:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:14,691 INFO L225 Difference]: With dead ends: 40 [2021-08-26 02:09:14,691 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 02:09:14,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 896.4ms TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2021-08-26 02:09:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 02:09:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 02:09:14,693 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) [2021-08-26 02:09:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 02:09:14,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2021-08-26 02:09:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:14,694 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 02:09:14,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 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) [2021-08-26 02:09:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 02:09:14,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 02:09:14,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:14,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:14,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-26 02:09:14,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-26 02:09:14,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 02:09:14,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:14,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:15,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:15,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:15,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:15,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:15,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:15,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:16,606 INFO L857 garLoopResultBuilder]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2021-08-26 02:09:16,606 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-08-26 02:09:16,607 INFO L853 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse3 (+ |~#pp~0.offset| (* ULTIMATE.start_f_~i~1 4)))) (and (< 0 ULTIMATE.start_init_~i~0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (<= 2 ULTIMATE.start_main_~b~0.offset) (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base) (= (select .cse0 .cse1) 0) (= ULTIMATE.start_main_~a~0.base 0) (= (select .cse2 .cse1) 0) (<= 2 |ULTIMATE.start_malloc_#res.offset|) (<= ULTIMATE.start_main_~b~0.offset 2) (<= |ULTIMATE.start_malloc_#res.offset| 2) (= (+ (* 4 ULTIMATE.start_f_~i~1) |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (<= 1 ULTIMATE.start_main_~a~0.offset) (= ULTIMATE.start_f_~pointer.offset 1) (= (select .cse0 .cse3) 0) (<= ULTIMATE.start_main_~a~0.offset 1) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (= (select .cse2 .cse3) 0))) [2021-08-26 02:09:16,608 INFO L857 garLoopResultBuilder]: For program point L27-6(lines 27 33) no Hoare annotation was computed. [2021-08-26 02:09:16,608 INFO L853 garLoopResultBuilder]: At program point L27-7(lines 27 33) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse20 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse19 (+ |~#pp~0.offset| 4))) (let ((.cse0 (< 0 ULTIMATE.start_init_~i~0)) (.cse1 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse2 (<= 2 ULTIMATE.start_main_~b~0.offset)) (.cse3 (= (select .cse20 .cse19) 0)) (.cse4 (= (select .cse20 |~#pp~0.offset|) ULTIMATE.start_main_~a~0.base)) (.cse5 (= ULTIMATE.start_main_~a~0.base 0)) (.cse8 (* 4 ULTIMATE.start_f_~i~1)) (.cse6 (= (select .cse18 .cse19) 0)) (.cse7 (<= 2 |ULTIMATE.start_malloc_#res.offset|)) (.cse9 (<= ULTIMATE.start_main_~b~0.offset 2)) (.cse10 (<= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse11 (= 2 ULTIMATE.start_f_~pointer.offset)) (.cse12 (= |~#pp~0.offset| 0)) (.cse13 (<= 1 ULTIMATE.start_main_~a~0.offset)) (.cse14 (<= ULTIMATE.start_main_~a~0.offset 1)) (.cse15 (<= |~#pstate~0.offset| 0)) (.cse16 (= ULTIMATE.start_main_~a~0.offset (select .cse18 |~#pp~0.offset|))) (.cse17 (= (select (select |#memory_int| |~#pstate~0.base|) 0) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (+ .cse8 |~#pstate~0.offset|) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ .cse8 |~#pp~0.offset|) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse8 4) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 |~#pstate~0.offset|) .cse15 .cse16 .cse17)))) [2021-08-26 02:09:16,608 INFO L857 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2021-08-26 02:09:16,608 INFO L853 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse10 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse2 (= (select .cse1 .cse10) 0)) (.cse4 (= (select .cse3 .cse10) 0)) (.cse5 (= |~#pp~0.offset| 0)) (.cse6 (= ~counter~0 1)) (.cse7 (<= 0 |~#pstate~0.offset|)) (.cse8 (<= |~#pstate~0.offset| 0))) (or (and .cse0 (= (select .cse1 0) 0) .cse2 (= (select .cse3 |~#pp~0.offset|) 0) .cse4 (<= 1 ULTIMATE.start_init_~i~0) .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ (* ULTIMATE.start_init_~i~0 4) |~#pp~0.offset|))) (and .cse0 .cse2 (= (select .cse3 .cse9) 0) .cse4 .cse5 (= ULTIMATE.start_init_~i~0 0) .cse6 .cse7 .cse8 (= (select .cse1 .cse9) 0)))))) [2021-08-26 02:09:16,609 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 45) no Hoare annotation was computed. [2021-08-26 02:09:16,609 INFO L857 garLoopResultBuilder]: For program point L36-1(lines 36 45) no Hoare annotation was computed. [2021-08-26 02:09:16,609 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 02:09:16,609 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 02:09:16,609 INFO L857 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2021-08-26 02:09:16,609 INFO L857 garLoopResultBuilder]: For program point L28-1(lines 28 32) no Hoare annotation was computed. [2021-08-26 02:09:16,610 INFO L860 garLoopResultBuilder]: At program point L70(lines 53 71) the Hoare annotation is: true [2021-08-26 02:09:16,610 INFO L857 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2021-08-26 02:09:16,610 INFO L853 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse24 (* 4 ULTIMATE.start_f_~i~1))) (let ((.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse13 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (.cse25 (* ULTIMATE.start_g_~i~2 4)) (.cse26 (select |#memory_int| |~#pstate~0.base|)) (.cse5 (+ |~#pp~0.offset| 4)) (.cse10 (+ .cse24 |~#pstate~0.offset|))) (let ((.cse1 (<= .cse5 .cse10)) (.cse17 (= (select .cse26 .cse5) 1)) (.cse0 (< 0 ULTIMATE.start_init_~i~0)) (.cse22 (<= ULTIMATE.start_g_~pointer.offset 1)) (.cse2 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse3 (<= 2 ULTIMATE.start_main_~b~0.offset)) (.cse6 (= (select .cse26 (+ |~#pstate~0.offset| .cse25)) 1)) (.cse7 (<= 0 |~#pp~0.offset|)) (.cse8 (= .cse13 ULTIMATE.start_main_~a~0.base)) (.cse9 (= ULTIMATE.start_main_~a~0.base 0)) (.cse11 (<= |~#pp~0.offset| 0)) (.cse12 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse14 (<= 2 |ULTIMATE.start_malloc_#res.offset|)) (.cse23 (< 0 ULTIMATE.start_g_~pointer.offset)) (.cse15 (<= ULTIMATE.start_main_~b~0.offset 2)) (.cse16 (<= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse18 (= 2 ULTIMATE.start_f_~pointer.offset)) (.cse19 (<= 0 |~#pstate~0.offset|)) (.cse20 (<= |~#pstate~0.offset| 0)) (.cse21 (= ULTIMATE.start_main_~a~0.offset (select .cse4 |~#pp~0.offset|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (select .cse4 .cse5) 2) (= ULTIMATE.start_g_~pointer.offset 1) .cse6 .cse7 .cse8 .cse9 (< .cse10 (+ 5 |~#pp~0.offset|)) .cse11 .cse12 (= ULTIMATE.start_g_~pointer.base .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_g_~i~2 0) .cse19 .cse20 .cse21) (and .cse0 .cse22 .cse3 (or (and (= ULTIMATE.start_f_~i~1 0) .cse2 .cse7 .cse11 .cse12 .cse17 .cse19 .cse20) (and .cse1 .cse2 .cse7 .cse11 .cse12 .cse17 .cse19 .cse20)) .cse8 .cse9 .cse14 .cse23 .cse15 .cse16 .cse21 (<= 2 ULTIMATE.start_g_~i~2)) (and .cse0 .cse22 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 (= .cse24 4) .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 (= ULTIMATE.start_g_~i~2 1) .cse18 .cse19 .cse20 .cse21 (= (select .cse4 (+ .cse25 |~#pp~0.offset|)) 2)))))) [2021-08-26 02:09:16,610 INFO L857 garLoopResultBuilder]: For program point L38-6(lines 38 44) no Hoare annotation was computed. [2021-08-26 02:09:16,610 INFO L853 garLoopResultBuilder]: At program point L38-7(lines 38 44) the Hoare annotation is: (let ((.cse19 (+ |~#pp~0.offset| 4)) (.cse17 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (< 0 ULTIMATE.start_init_~i~0)) (.cse1 (<= 2 ULTIMATE.start_main_~b~0.offset)) (.cse7 (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|) ULTIMATE.start_main_~a~0.base)) (.cse8 (= ULTIMATE.start_main_~a~0.base 0)) (.cse9 (<= 2 |ULTIMATE.start_malloc_#res.offset|)) (.cse10 (<= ULTIMATE.start_main_~b~0.offset 2)) (.cse11 (<= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse12 (= |~#pp~0.offset| 0)) (.cse13 (<= 1 ULTIMATE.start_main_~a~0.offset)) (.cse14 (<= ULTIMATE.start_main_~a~0.offset 1)) (.cse15 (= ULTIMATE.start_main_~a~0.offset (select .cse17 |~#pp~0.offset|))) (.cse2 (<= .cse19 (+ (* 4 ULTIMATE.start_f_~i~1) |~#pstate~0.offset|))) (.cse6 (= ULTIMATE.start_f_~i~1 0)) (.cse3 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse4 (<= |~#pstate~0.offset| |~#pp~0.offset|)) (.cse16 (= (select (select |#memory_int| |~#pstate~0.base|) .cse19) 1)) (.cse5 (<= |~#pp~0.offset| |~#pstate~0.offset|))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse4 .cse5)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 2 ULTIMATE.start_g_~i~2)) (and .cse0 (or (and .cse2 .cse3 .cse4 .cse16 .cse5) (and .cse6 .cse3 .cse4 .cse16 .cse5)) .cse1 .cse7 .cse8 .cse9 (= ULTIMATE.start_g_~pointer.offset 2) .cse10 .cse11 .cse12 (= ULTIMATE.start_g_~i~2 0) .cse13 .cse15 (<= (select .cse17 (+ (* ULTIMATE.start_g_~i~2 4) |~#pp~0.offset|)) 1)) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (let ((.cse18 (<= .cse19 (+ (* 4 ULTIMATE.start_g_~i~2) |~#pstate~0.offset|)))) (or (and .cse2 .cse3 .cse18 .cse4 .cse16 .cse5) (and .cse6 .cse3 .cse18 .cse4 .cse16 .cse5))))))) [2021-08-26 02:09:16,611 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-08-26 02:09:16,611 INFO L857 garLoopResultBuilder]: For program point L6(lines 1 71) no Hoare annotation was computed. [2021-08-26 02:09:16,611 INFO L857 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2021-08-26 02:09:16,611 INFO L857 garLoopResultBuilder]: For program point L6-1(lines 1 71) no Hoare annotation was computed. [2021-08-26 02:09:16,611 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 02:09:16,611 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-08-26 02:09:16,612 INFO L853 garLoopResultBuilder]: At program point L49(lines 48 51) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4))) (and (< 0 ULTIMATE.start_init_~i~0) (<= 2 ~counter~0) (= |ULTIMATE.start_malloc_#res.base| 0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= (select .cse0 0) 0) (= |ULTIMATE.start_malloc_#res.offset| 1) (= (select .cse0 .cse1) 0) (= (select .cse2 |~#pp~0.offset|) 0) (= (select .cse2 .cse1) 0) (= |~#pp~0.offset| 0) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0) (<= ~counter~0 2))) [2021-08-26 02:09:16,612 INFO L853 garLoopResultBuilder]: At program point L49-1(lines 48 51) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4))) (and (< 0 ULTIMATE.start_init_~i~0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= (select .cse0 0) 0) (= (select .cse0 .cse1) 0) (= (select .cse2 |~#pp~0.offset|) 0) (= ULTIMATE.start_main_~a~0.base 0) (= (select .cse2 .cse1) 0) (<= 2 |ULTIMATE.start_malloc_#res.offset|) (<= |ULTIMATE.start_malloc_#res.offset| 2) (= |~#pp~0.offset| 0) (<= 1 ULTIMATE.start_main_~a~0.offset) (<= ULTIMATE.start_main_~a~0.offset 1) (<= 0 |~#pstate~0.offset|) (<= |~#pstate~0.offset| 0))) [2021-08-26 02:09:16,612 INFO L857 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2021-08-26 02:09:16,612 INFO L857 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2021-08-26 02:09:16,612 INFO L857 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2021-08-26 02:09:16,612 INFO L857 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2021-08-26 02:09:16,612 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 02:09:16,613 INFO L857 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2021-08-26 02:09:16,613 INFO L857 garLoopResultBuilder]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2021-08-26 02:09:16,613 INFO L857 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2021-08-26 02:09:16,613 INFO L857 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2021-08-26 02:09:16,617 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:09:16,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,641 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,641 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:09:16 BoogieIcfgContainer [2021-08-26 02:09:16,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 02:09:16,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 02:09:16,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 02:09:16,701 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 02:09:16,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:08:56" (3/4) ... [2021-08-26 02:09:16,704 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 02:09:16,718 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-08-26 02:09:16,725 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 02:09:16,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:09:16,727 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:09:16,751 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 < i && 2 <= counter) && \result == 0) && !(pp == pstate)) && #memory_$Pointer$[pp][0] == 0) && \result == 1) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && pp == 0) && 0 <= pstate) && pstate <= 0) && counter <= 2 [2021-08-26 02:09:16,752 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 < i && !(pp == pstate)) && #memory_$Pointer$[pp][0] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == 0) && a == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && \result <= 2) && pp == 0) && 1 <= a) && a <= 1) && 0 <= pstate) && pstate <= 0 [2021-08-26 02:09:16,752 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 < i && !(pp == pstate)) && 2 <= b) && pointer == a) && #memory_$Pointer$[pp][pp + 4] == 0) && a == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && b <= 2) && \result <= 2) && 4 * i + pp == 0) && pp == 0) && 1 <= a) && pointer == 1) && #memory_$Pointer$[pp][pp + i * 4] == 0) && a <= 1) && 0 <= pstate) && pstate <= 0) && #memory_$Pointer$[pp][pp + i * 4] == 0 [2021-08-26 02:09:16,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 < i && !(pp == pstate)) && 2 <= b) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == a) && a == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && 4 * i + pstate == 0) && b <= 2) && \result <= 2) && 2 == pointer) && pp == 0) && 1 <= a) && a <= 1) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) && unknown-#memory_int-unknown[pstate][0] == 1) && 4 * i + pp <= 0) || ((((((((((((((((((0 < i && !(pp == pstate)) && 2 <= b) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 4 * i == 4) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && b <= 2) && \result <= 2) && 2 == pointer) && pp == 0) && 1 <= a) && a <= 1) && 0 <= pstate) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) && unknown-#memory_int-unknown[pstate][0] == 1) [2021-08-26 02:09:16,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 < i && pp + 4 <= 4 * i + pstate) && !(pp == pstate)) && 2 <= b) && #memory_$Pointer$[pp][pp + 4] == 2) && pointer == 1) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && 0 <= pp) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 4 * i + pstate < 5 + pp) && pp <= 0) && a == 1) && pointer == #memory_$Pointer$[pp][pp]) && 2 <= \result) && b <= 2) && \result <= 2) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 2 == pointer) && i == 0) && 0 <= pstate) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) || (((((((((((0 < i && pointer <= 1) && 2 <= b) && ((((((((i == 0 && !(pp == pstate)) && 0 <= pp) && pp <= 0) && a == 1) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 0 <= pstate) && pstate <= 0) || (((((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && 0 <= pp) && pp <= 0) && a == 1) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 0 <= pstate) && pstate <= 0))) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && 0 < pointer) && b <= 2) && \result <= 2) && a == #memory_$Pointer$[pp][pp]) && 2 <= i)) || ((((((((((((((((((((0 < i && pointer <= 1) && !(pp == pstate)) && 2 <= b) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && 0 <= pp) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 4 * i == 4) && pp <= 0) && a == 1) && 2 <= \result) && 0 < pointer) && b <= 2) && \result <= 2) && i == 1) && 2 == pointer) && 0 <= pstate) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) && #memory_$Pointer$[pp][i * 4 + pp] == 2) [2021-08-26 02:09:16,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 < i && 2 <= b) && ((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && pstate <= pp) && pp <= pstate) || (((i == 0 && !(pp == pstate)) && pstate <= pp) && pp <= pstate))) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && b <= 2) && \result <= 2) && pp == 0) && 1 <= a) && a <= 1) && a == #memory_$Pointer$[pp][pp]) && 2 <= i) || (((((((((((((0 < i && (((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate) || ((((i == 0 && !(pp == pstate)) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate))) && 2 <= b) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && pointer == 2) && b <= 2) && \result <= 2) && pp == 0) && i == 0) && 1 <= a) && a == #memory_$Pointer$[pp][pp]) && #memory_$Pointer$[pp][i * 4 + pp] <= 1)) || (((((((((((0 < i && 2 <= b) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && b <= 2) && \result <= 2) && pp == 0) && 1 <= a) && a <= 1) && a == #memory_$Pointer$[pp][pp]) && ((((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && pp + 4 <= 4 * i + pstate) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate) || (((((i == 0 && !(pp == pstate)) && pp + 4 <= 4 * i + pstate) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate))) [2021-08-26 02:09:16,776 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 02:09:16,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 02:09:16,778 INFO L168 Benchmark]: Toolchain (without parser) took 21589.30 ms. Allocated memory was 69.2 MB in the beginning and 249.6 MB in the end (delta: 180.4 MB). Free memory was 50.1 MB in the beginning and 98.8 MB in the end (delta: -48.7 MB). Peak memory consumption was 131.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:16,778 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 69.2 MB. Free memory was 51.7 MB in the beginning and 51.7 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:09:16,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.26 ms. Allocated memory is still 69.2 MB. Free memory was 49.9 MB in the beginning and 52.8 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:16,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.17 ms. Allocated memory is still 69.2 MB. Free memory was 52.8 MB in the beginning and 50.9 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:09:16,779 INFO L168 Benchmark]: Boogie Preprocessor took 25.32 ms. Allocated memory is still 69.2 MB. Free memory was 50.9 MB in the beginning and 49.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:16,779 INFO L168 Benchmark]: RCFGBuilder took 555.19 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 49.2 MB in the beginning and 72.7 MB in the end (delta: -23.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:16,779 INFO L168 Benchmark]: TraceAbstraction took 20677.65 ms. Allocated memory was 96.5 MB in the beginning and 249.6 MB in the end (delta: 153.1 MB). Free memory was 72.2 MB in the beginning and 103.0 MB in the end (delta: -30.8 MB). Peak memory consumption was 144.0 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:16,780 INFO L168 Benchmark]: Witness Printer took 75.82 ms. Allocated memory is still 249.6 MB. Free memory was 103.0 MB in the beginning and 98.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:16,785 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.18 ms. Allocated memory is still 69.2 MB. Free memory was 51.7 MB in the beginning and 51.7 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 214.26 ms. Allocated memory is still 69.2 MB. Free memory was 49.9 MB in the beginning and 52.8 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.17 ms. Allocated memory is still 69.2 MB. Free memory was 52.8 MB in the beginning and 50.9 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.32 ms. Allocated memory is still 69.2 MB. Free memory was 50.9 MB in the beginning and 49.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 555.19 ms. Allocated memory was 69.2 MB in the beginning and 96.5 MB in the end (delta: 27.3 MB). Free memory was 49.2 MB in the beginning and 72.7 MB in the end (delta: -23.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20677.65 ms. Allocated memory was 96.5 MB in the beginning and 249.6 MB in the end (delta: 153.1 MB). Free memory was 72.2 MB in the beginning and 103.0 MB in the end (delta: -30.8 MB). Peak memory consumption was 144.0 MB. Max. memory is 16.1 GB. * Witness Printer took 75.82 ms. Allocated memory is still 249.6 MB. Free memory was 103.0 MB in the beginning and 98.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 8]: 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 1 procedures, 35 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20539.5ms, OverallIterations: 13, TraceHistogramMax: 3, EmptinessCheckTime: 19.0ms, AutomataDifference: 6739.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1692.5ms, InitialAbstractionConstructionTime: 8.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 405 SDtfs, 1069 SDslu, 1594 SDs, 0 SdLazy, 2193 SolverSat, 327 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 3229.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 231 SyntacticMatches, 8 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 5461.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=8, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 106.5ms AutomataMinimizationTime, 13 MinimizatonAttempts, 321 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 23 NumberOfFragments, 1130 HoareAnnotationTreeSize, 8 FomulaSimplifications, 54935 FormulaSimplificationTreeSizeReduction, 193.9ms HoareSimplificationTime, 8 FomulaSimplificationsInter, 5572 FormulaSimplificationTreeSizeReductionInter, 1488.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 162.1ms SsaConstructionTime, 690.0ms SatisfiabilityAnalysisTime, 7428.4ms InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 583 ConstructedInterpolants, 14 QuantifiedInterpolants, 6253 SizeOfPredicates, 87 NumberOfNonLiveVariables, 1892 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 115/176 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 2 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant [2021-08-26 02:09:16,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((0 < i && !(pp == pstate)) && #memory_$Pointer$[pp][0] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == 0) && a == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && \result <= 2) && pp == 0) && 1 <= a) && a <= 1) && 0 <= pstate) && pstate <= 0 - InvariantResult [Line: 38]: Loop Invariant [2021-08-26 02:09:16,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((0 < i && pp + 4 <= 4 * i + pstate) && !(pp == pstate)) && 2 <= b) && #memory_$Pointer$[pp][pp + 4] == 2) && pointer == 1) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && 0 <= pp) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 4 * i + pstate < 5 + pp) && pp <= 0) && a == 1) && pointer == #memory_$Pointer$[pp][pp]) && 2 <= \result) && b <= 2) && \result <= 2) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 2 == pointer) && i == 0) && 0 <= pstate) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) || (((((((((((0 < i && pointer <= 1) && 2 <= b) && ((((((((i == 0 && !(pp == pstate)) && 0 <= pp) && pp <= 0) && a == 1) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 0 <= pstate) && pstate <= 0) || (((((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && 0 <= pp) && pp <= 0) && a == 1) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 0 <= pstate) && pstate <= 0))) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && 0 < pointer) && b <= 2) && \result <= 2) && a == #memory_$Pointer$[pp][pp]) && 2 <= i)) || ((((((((((((((((((((0 < i && pointer <= 1) && !(pp == pstate)) && 2 <= b) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && 0 <= pp) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 4 * i == 4) && pp <= 0) && a == 1) && 2 <= \result) && 0 < pointer) && b <= 2) && \result <= 2) && i == 1) && 2 == pointer) && 0 <= pstate) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) && #memory_$Pointer$[pp][i * 4 + pp] == 2) - InvariantResult [Line: 48]: Loop Invariant [2021-08-26 02:09:16,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((0 < i && 2 <= counter) && \result == 0) && !(pp == pstate)) && #memory_$Pointer$[pp][0] == 0) && \result == 1) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && pp == 0) && 0 <= pstate) && pstate <= 0) && counter <= 2 - InvariantResult [Line: 27]: Loop Invariant [2021-08-26 02:09:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((0 < i && !(pp == pstate)) && 2 <= b) && pointer == a) && #memory_$Pointer$[pp][pp + 4] == 0) && a == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && b <= 2) && \result <= 2) && 4 * i + pp == 0) && pp == 0) && 1 <= a) && pointer == 1) && #memory_$Pointer$[pp][pp + i * 4] == 0) && a <= 1) && 0 <= pstate) && pstate <= 0) && #memory_$Pointer$[pp][pp + i * 4] == 0 - InvariantResult [Line: 38]: Loop Invariant [2021-08-26 02:09:16,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((0 < i && 2 <= b) && ((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && pstate <= pp) && pp <= pstate) || (((i == 0 && !(pp == pstate)) && pstate <= pp) && pp <= pstate))) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && b <= 2) && \result <= 2) && pp == 0) && 1 <= a) && a <= 1) && a == #memory_$Pointer$[pp][pp]) && 2 <= i) || (((((((((((((0 < i && (((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate) || ((((i == 0 && !(pp == pstate)) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate))) && 2 <= b) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && pointer == 2) && b <= 2) && \result <= 2) && pp == 0) && i == 0) && 1 <= a) && a == #memory_$Pointer$[pp][pp]) && #memory_$Pointer$[pp][i * 4 + pp] <= 1)) || (((((((((((0 < i && 2 <= b) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 2 <= \result) && b <= 2) && \result <= 2) && pp == 0) && 1 <= a) && a <= 1) && a == #memory_$Pointer$[pp][pp]) && ((((((pp + 4 <= 4 * i + pstate && !(pp == pstate)) && pp + 4 <= 4 * i + pstate) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate) || (((((i == 0 && !(pp == pstate)) && pp + 4 <= 4 * i + pstate) && pstate <= pp) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && pp <= pstate))) - InvariantResult [Line: 27]: Loop Invariant [2021-08-26 02:09:16,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((0 < i && !(pp == pstate)) && 2 <= b) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == a) && a == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && 4 * i + pstate == 0) && b <= 2) && \result <= 2) && 2 == pointer) && pp == 0) && 1 <= a) && a <= 1) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) && unknown-#memory_int-unknown[pstate][0] == 1) && 4 * i + pp <= 0) || ((((((((((((((((((0 < i && !(pp == pstate)) && 2 <= b) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == a) && a == 0) && 4 * i == 4) && #memory_$Pointer$[pp][pp + 4] == 0) && 2 <= \result) && b <= 2) && \result <= 2) && 2 == pointer) && pp == 0) && 1 <= a) && a <= 1) && 0 <= pstate) && pstate <= 0) && a == #memory_$Pointer$[pp][pp]) && unknown-#memory_int-unknown[pstate][0] == 1) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant [2021-08-26 02:09:16,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:09:16,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:09:16,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((!(pp == pstate) && #memory_$Pointer$[pp][0] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 1 <= i) && pp == 0) && counter == 1) && 0 <= pstate) && pstate <= 0) || (((((((((!(pp == pstate) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][i * 4 + pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && pp == 0) && i == 0) && counter == 1) && 0 <= pstate) && pstate <= 0) && #memory_$Pointer$[pp][i * 4 + pp] == 0) RESULT: Ultimate proved your program to be correct! [2021-08-26 02:09:16,860 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...