./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/count_up_down-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/loops/count_up_down-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5879e48447fc7f125bd26345b332bcb57cae00365c3de30b5785162154970826 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:25:44,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:25:44,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:25:44,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:25:44,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:25:44,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:25:44,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:25:44,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:25:44,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:25:44,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:25:44,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:25:44,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:25:44,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:25:44,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:25:44,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:25:44,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:25:44,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:25:44,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:25:44,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:25:44,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:25:44,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:25:44,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:25:44,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:25:44,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:25:44,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:25:44,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:25:44,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:25:44,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:25:44,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:25:44,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:25:44,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:25:44,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:25:44,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:25:44,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:25:44,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:25:44,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:25:44,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:25:44,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:25:44,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:25:44,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:25:44,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:25:44,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 09:25:44,184 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:25:44,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:25:44,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:25:44,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:25:44,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:25:44,187 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:25:44,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:25:44,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:25:44,188 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:25:44,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:25:44,189 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:25:44,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:25:44,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:25:44,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:25:44,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:25:44,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:25:44,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:25:44,190 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:25:44,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:25:44,190 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:25:44,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:25:44,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:25:44,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:25:44,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:25:44,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:25:44,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:25:44,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:25:44,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:25:44,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:25:44,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:25:44,193 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:25:44,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:25:44,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:25:44,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:25:44,194 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 -> 5879e48447fc7f125bd26345b332bcb57cae00365c3de30b5785162154970826 [2021-12-17 09:25:44,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:25:44,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:25:44,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:25:44,421 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:25:44,422 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:25:44,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/count_up_down-1.c [2021-12-17 09:25:44,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d3141d4/bb46bfed5c3a4894976e1bd98232e5c3/FLAG4f35b3671 [2021-12-17 09:25:44,889 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:25:44,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/count_up_down-1.c [2021-12-17 09:25:44,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d3141d4/bb46bfed5c3a4894976e1bd98232e5c3/FLAG4f35b3671 [2021-12-17 09:25:44,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d3141d4/bb46bfed5c3a4894976e1bd98232e5c3 [2021-12-17 09:25:44,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:25:44,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:25:44,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:25:44,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:25:44,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:25:44,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:25:44" (1/1) ... [2021-12-17 09:25:44,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6f2cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:44, skipping insertion in model container [2021-12-17 09:25:44,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:25:44" (1/1) ... [2021-12-17 09:25:44,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:25:44,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:25:45,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/count_up_down-1.c[327,340] [2021-12-17 09:25:45,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:25:45,084 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:25:45,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/count_up_down-1.c[327,340] [2021-12-17 09:25:45,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:25:45,109 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:25:45,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45 WrapperNode [2021-12-17 09:25:45,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:25:45,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:25:45,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:25:45,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:25:45,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,139 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2021-12-17 09:25:45,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:25:45,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:25:45,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:25:45,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:25:45,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:25:45,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:25:45,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:25:45,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:25:45,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (1/1) ... [2021-12-17 09:25:45,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:25:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:25:45,196 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-12-17 09:25:45,221 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-12-17 09:25:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:25:45,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:25:45,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:25:45,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:25:45,291 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:25:45,292 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:25:45,390 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:25:45,395 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:25:45,395 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 09:25:45,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:25:45 BoogieIcfgContainer [2021-12-17 09:25:45,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:25:45,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:25:45,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:25:45,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:25:45,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:25:44" (1/3) ... [2021-12-17 09:25:45,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a5bf33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:25:45, skipping insertion in model container [2021-12-17 09:25:45,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:25:45" (2/3) ... [2021-12-17 09:25:45,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a5bf33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:25:45, skipping insertion in model container [2021-12-17 09:25:45,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:25:45" (3/3) ... [2021-12-17 09:25:45,412 INFO L111 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2021-12-17 09:25:45,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:25:45,426 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:25:45,466 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:25:45,472 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 09:25:45,472 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:25:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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-12-17 09:25:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 09:25:45,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:25:45,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 09:25:45,502 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:25:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:25:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-17 09:25:45,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:25:45,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948447014] [2021-12-17 09:25:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:25:45,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:25:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:25:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:45,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:25:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948447014] [2021-12-17 09:25:45,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948447014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:25:45,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:25:45,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 09:25:45,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933756030] [2021-12-17 09:25:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:25:45,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 09:25:45,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:25:45,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 09:25:45,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 09:25:45,824 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-12-17 09:25:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:25:45,915 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-12-17 09:25:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 09:25:45,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2021-12-17 09:25:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:25:45,928 INFO L225 Difference]: With dead ends: 26 [2021-12-17 09:25:45,929 INFO L226 Difference]: Without dead ends: 8 [2021-12-17 09:25:45,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-17 09:25:45,938 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:25:45,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:25:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-17 09:25:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-17 09:25:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-12-17 09:25:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-17 09:25:45,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-17 09:25:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:25:45,966 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-17 09:25:45,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-12-17 09:25:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-17 09:25:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 09:25:45,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:25:45,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:25:45,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:25:45,969 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:25:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:25:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-12-17 09:25:45,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:25:45,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219422550] [2021-12-17 09:25:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:25:45,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:25:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:25:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:46,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:25:46,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219422550] [2021-12-17 09:25:46,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219422550] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:25:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542977602] [2021-12-17 09:25:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:25:46,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:25:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:25:46,307 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-12-17 09:25:46,308 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-12-17 09:25:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:25:46,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 09:25:46,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:25:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:46,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:25:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:46,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542977602] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:25:46,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:25:46,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-17 09:25:46,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861585240] [2021-12-17 09:25:46,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:25:46,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 09:25:46,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:25:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 09:25:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-17 09:25:46,615 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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-12-17 09:25:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:25:46,899 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-12-17 09:25:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 09:25:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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 7 [2021-12-17 09:25:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:25:46,901 INFO L225 Difference]: With dead ends: 19 [2021-12-17 09:25:46,901 INFO L226 Difference]: Without dead ends: 11 [2021-12-17 09:25:46,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-12-17 09:25:46,903 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:25:46,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:25:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-17 09:25:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-17 09:25:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-12-17 09:25:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-12-17 09:25:46,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-12-17 09:25:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:25:46,907 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-12-17 09:25:46,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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-12-17 09:25:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-12-17 09:25:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 09:25:46,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:25:46,907 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-12-17 09:25:46,931 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-12-17 09:25:47,119 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-12-17 09:25:47,120 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:25:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:25:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-12-17 09:25:47,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:25:47,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297566282] [2021-12-17 09:25:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:25:47,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:25:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:25:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:47,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:25:47,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297566282] [2021-12-17 09:25:47,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297566282] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:25:47,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736742991] [2021-12-17 09:25:47,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:25:47,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:25:47,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:25:47,516 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-12-17 09:25:47,519 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-12-17 09:25:47,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:25:47,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:25:47,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 09:25:47,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:25:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:47,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:25:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:48,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736742991] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:25:48,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:25:48,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-12-17 09:25:48,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299896651] [2021-12-17 09:25:48,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:25:48,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 09:25:48,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:25:48,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 09:25:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-12-17 09:25:48,479 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-12-17 09:25:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:25:56,712 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-12-17 09:25:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 09:25:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 10 [2021-12-17 09:25:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:25:56,714 INFO L225 Difference]: With dead ends: 23 [2021-12-17 09:25:56,714 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 09:25:56,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2021-12-17 09:25:56,716 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:25:56,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 14 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 09:25:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 09:25:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-17 09:25:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-12-17 09:25:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-12-17 09:25:56,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2021-12-17 09:25:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:25:56,722 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-12-17 09:25:56,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-12-17 09:25:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-12-17 09:25:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 09:25:56,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:25:56,723 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-12-17 09:25:56,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 09:25:56,931 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-12-17 09:25:56,932 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:25:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:25:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2021-12-17 09:25:56,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:25:56,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226074116] [2021-12-17 09:25:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:25:56,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:25:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:25:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:58,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:25:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226074116] [2021-12-17 09:25:58,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226074116] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:25:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484771122] [2021-12-17 09:25:58,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:25:58,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:25:58,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:25:58,096 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-12-17 09:25:58,098 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-12-17 09:25:58,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-17 09:25:58,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:25:58,435 WARN L261 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-17 09:25:58,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:25:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:25:58,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:26:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:26:05,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484771122] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:26:05,501 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:26:05,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2021-12-17 09:26:05,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560939036] [2021-12-17 09:26:05,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:26:05,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 09:26:05,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:26:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 09:26:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2021-12-17 09:26:05,506 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 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-12-17 09:26:07,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:26:09,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:29:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:29:07,955 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-12-17 09:29:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 09:29:07,957 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 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) Word has length 16 [2021-12-17 09:29:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:29:07,957 INFO L225 Difference]: With dead ends: 35 [2021-12-17 09:29:07,958 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 09:29:07,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 184.0s TimeCoverageRelationStatistics Valid=810, Invalid=2041, Unknown=11, NotChecked=0, Total=2862 [2021-12-17 09:29:07,960 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-12-17 09:29:07,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 23 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 230 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2021-12-17 09:29:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 09:29:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 09:29:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-12-17 09:29:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2021-12-17 09:29:07,977 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2021-12-17 09:29:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:29:07,977 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2021-12-17 09:29:07,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 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-12-17 09:29:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2021-12-17 09:29:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 09:29:07,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:29:07,983 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2021-12-17 09:29:07,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 09:29:08,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:08,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:29:08,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:29:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1394044683, now seen corresponding path program 4 times [2021-12-17 09:29:08,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:29:08,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749396139] [2021-12-17 09:29:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:29:08,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:29:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:29:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:29:10,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:29:10,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749396139] [2021-12-17 09:29:10,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749396139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:29:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067032869] [2021-12-17 09:29:10,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:29:10,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:29:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:29:10,172 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-12-17 09:29:10,176 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-12-17 09:29:15,535 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:29:15,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:29:15,537 WARN L261 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-17 09:29:15,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:29:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:29:18,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:30:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:30:27,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067032869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:30:27,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:30:27,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 73 [2021-12-17 09:30:27,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529972553] [2021-12-17 09:30:27,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:30:27,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2021-12-17 09:30:27,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:30:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-12-17 09:30:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=4075, Unknown=1, NotChecked=0, Total=5256 [2021-12-17 09:30:27,600 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 73 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 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-12-17 09:30:29,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:30:38,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:30:51,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:30:53,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:30:59,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:31:03,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:25,768 WARN L227 SmtUtils]: Spent 1.70m on a formula simplification that was a NOOP. DAG size: 328 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:34:29,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:31,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:49,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse37 (* 4294967296 (div |c_ULTIMATE.start_main_~n~0#1| 4294967296)))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 18)) (.cse8 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 9)) (.cse7 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 10)) (.cse20 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 2)) (.cse24 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 21)) (.cse1 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 15)) (.cse28 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 3)) (.cse30 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 20)) (.cse5 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 19)) (.cse23 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 22)) (.cse21 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 1)) (.cse26 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 11)) (.cse16 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 12)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 14)) (.cse15 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 13)) (.cse12 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 7)) (.cse17 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 8)) (.cse13 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 6)) (.cse10 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 17)) (.cse32 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 16)) (.cse42 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 5)) (.cse34 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 4)) (.cse38 (+ (* 4294967296 (div |c_ULTIMATE.start_main_~y~0#1| 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (or (let ((.cse0 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse0 .cse1) (<= .cse2 .cse0))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967282) 4294967296))) (or (let ((.cse4 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse3 .cse4) (< .cse4 .cse5))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967278) 4294967296))) (or (let ((.cse6 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse6 .cse7) (<= .cse8 .cse6))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967287) 4294967296))) (or (let ((.cse9 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse9 .cse3) (<= .cse10 .cse9))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967279) 4294967296))) (or (let ((.cse11 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse11 .cse12) (<= .cse13 .cse11))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967290) 4294967296))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967284) 4294967296)) (let ((.cse14 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse14 .cse15) (<= .cse16 .cse14)))) (or (let ((.cse18 (+ |c_ULTIMATE.start_main_~n~0#1| (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))))) (and (<= .cse17 .cse18) (< .cse18 .cse8))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967288) 4294967296))) (or (let ((.cse19 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse19 .cse20) (<= .cse21 .cse19))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967295) 4294967296))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967275) 4294967296)) (let ((.cse22 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 21) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse22 .cse23) (<= .cse24 .cse22)))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967286) 4294967296)) (let ((.cse25 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse25 .cse26) (<= .cse7 .cse25)))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967294) 4294967296)) (let ((.cse27 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse20 .cse27) (< .cse27 .cse28)))) (or (let ((.cse29 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 20) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse29 .cse24) (<= .cse30 .cse29))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967276) 4294967296))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967281) 4294967296)) (let ((.cse31 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse1 .cse31) (< .cse31 .cse32)))) (or (let ((.cse33 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse28 .cse33) (< .cse33 .cse34))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967277) 4294967296)) (let ((.cse35 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 19) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse35 .cse30) (<= .cse5 .cse35)))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967274) 4294967296)) (let ((.cse36 (+ |c_ULTIMATE.start_main_~n~0#1| (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 22) 4294967296))))) (and (< .cse36 (+ |c_ULTIMATE.start_main_~y~0#1| .cse37 23)) (<= .cse23 .cse36)))) (< .cse38 .cse21) (or (let ((.cse39 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse26 .cse39) (< .cse39 .cse16))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967285) 4294967296))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967283) 4294967296)) (let ((.cse40 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse40 .cse2) (<= .cse15 .cse40)))) (or (let ((.cse41 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse12 .cse41) (< .cse41 .cse17))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967289) 4294967296))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967291) 4294967296)) (let ((.cse43 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (<= .cse42 .cse43) (< .cse43 .cse13)))) (or (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967280) 4294967296)) (let ((.cse44 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse44 .cse10) (<= .cse32 .cse44)))) (or (let ((.cse45 (+ (* 4294967296 (div (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296)) |c_ULTIMATE.start_main_~n~0#1|))) (and (< .cse45 .cse42) (<= .cse34 .cse45))) (< 0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4294967292) 4294967296))) (<= (+ |c_ULTIMATE.start_main_~y~0#1| .cse37) .cse38)))) is different from false [2021-12-17 09:34:50,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:52,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:53,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:56,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:34:59,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:35:04,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:35:06,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 09:40:14,063 WARN L227 SmtUtils]: Spent 2.50m on a formula simplification that was a NOOP. DAG size: 314 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:40:16,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15