./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/iftelse.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-crafted-1/iftelse.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 a98f1431f10d7e60a67a648eec648b7f5eb5616fa0d511e794bbda916609379b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:21:58,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:21:58,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:21:58,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:21:58,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:21:58,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:21:58,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:21:58,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:21:58,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:21:58,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:21:58,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:21:58,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:21:58,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:21:58,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:21:58,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:21:58,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:21:58,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:21:58,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:21:58,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:21:58,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:21:58,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:21:58,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:21:58,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:21:58,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:21:58,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:21:58,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:21:58,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:21:58,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:21:58,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:21:58,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:21:58,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:21:58,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:21:58,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:21:58,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:21:58,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:21:58,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:21:58,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:21:58,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:21:58,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:21:58,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:21:58,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:21:58,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 10:21:58,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:21:58,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:21:58,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:21:58,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:21:58,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:21:58,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:21:58,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:21:58,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:21:58,806 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:21:58,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:21:58,807 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:21:58,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 10:21:58,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:21:58,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:21:58,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:21:58,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:21:58,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:21:58,808 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:21:58,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:21:58,808 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:21:58,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:21:58,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:21:58,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:21:58,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:21:58,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:21:58,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:21:58,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:21:58,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:21:58,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 10:21:58,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 10:21:58,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:21:58,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:21:58,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:21:58,812 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:21:58,812 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 -> a98f1431f10d7e60a67a648eec648b7f5eb5616fa0d511e794bbda916609379b [2021-12-17 10:21:59,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:21:59,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:21:59,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:21:59,066 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:21:59,067 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:21:59,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/iftelse.c [2021-12-17 10:21:59,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9def060b/5a20f054b1ad43c984e85e6381eae7bb/FLAGccea0e664 [2021-12-17 10:21:59,454 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:21:59,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c [2021-12-17 10:21:59,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9def060b/5a20f054b1ad43c984e85e6381eae7bb/FLAGccea0e664 [2021-12-17 10:21:59,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9def060b/5a20f054b1ad43c984e85e6381eae7bb [2021-12-17 10:21:59,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:21:59,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:21:59,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:21:59,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:21:59,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:21:59,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:21:59" (1/1) ... [2021-12-17 10:21:59,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48619255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:59, skipping insertion in model container [2021-12-17 10:21:59,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:21:59" (1/1) ... [2021-12-17 10:21:59,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:21:59,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:22:00,039 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-crafted-1/iftelse.c[406,419] [2021-12-17 10:22:00,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:22:00,060 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:22:00,072 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-crafted-1/iftelse.c[406,419] [2021-12-17 10:22:00,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:22:00,095 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:22:00,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00 WrapperNode [2021-12-17 10:22:00,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:22:00,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:22:00,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:22:00,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:22:00,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,126 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2021-12-17 10:22:00,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:22:00,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:22:00,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:22:00,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:22:00,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:22:00,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:22:00,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:22:00,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:22:00,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (1/1) ... [2021-12-17 10:22:00,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:22:00,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:22:00,186 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 10:22:00,191 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 10:22:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:22:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 10:22:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:22:00,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:22:00,268 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:22:00,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:22:00,364 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:22:00,369 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:22:00,369 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 10:22:00,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:22:00 BoogieIcfgContainer [2021-12-17 10:22:00,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:22:00,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:22:00,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:22:00,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:22:00,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:21:59" (1/3) ... [2021-12-17 10:22:00,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c06596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:22:00, skipping insertion in model container [2021-12-17 10:22:00,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:00" (2/3) ... [2021-12-17 10:22:00,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c06596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:22:00, skipping insertion in model container [2021-12-17 10:22:00,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:22:00" (3/3) ... [2021-12-17 10:22:00,389 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2021-12-17 10:22:00,392 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:22:00,392 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:22:00,446 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:22:00,462 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 10:22:00,467 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:22:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 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-12-17 10:22:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 10:22:00,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:22:00,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:22:00,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:22:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:22:00,485 INFO L85 PathProgramCache]: Analyzing trace with hash 183324244, now seen corresponding path program 1 times [2021-12-17 10:22:00,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:22:00,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959920465] [2021-12-17 10:22:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:00,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:22:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:00,908 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 10:22:00,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:22:00,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959920465] [2021-12-17 10:22:00,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959920465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:22:00,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:22:00,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 10:22:00,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708578653] [2021-12-17 10:22:00,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:22:00,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 10:22:00,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:22:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 10:22:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 10:22:00,942 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 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) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 10:22:02,991 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 10:22:05,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:22:07,258 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 10:22:09,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:22:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:22:09,406 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-17 10:22:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 10:22:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) Word has length 8 [2021-12-17 10:22:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:22:09,415 INFO L225 Difference]: With dead ends: 51 [2021-12-17 10:22:09,415 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 10:22:09,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 10:22:09,426 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2021-12-17 10:22:09,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 88 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2021-12-17 10:22:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 10:22:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2021-12-17 10:22:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 10:22:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-12-17 10:22:09,450 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2021-12-17 10:22:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:22:09,450 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-12-17 10:22:09,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 10:22:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2021-12-17 10:22:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 10:22:09,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:22:09,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:22:09,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 10:22:09,452 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:22:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:22:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1425053575, now seen corresponding path program 1 times [2021-12-17 10:22:09,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:22:09,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027468328] [2021-12-17 10:22:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:09,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:22:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:22:09,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:22:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027468328] [2021-12-17 10:22:09,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027468328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:22:09,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:22:09,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 10:22:09,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132541071] [2021-12-17 10:22:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:22:09,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 10:22:09,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:22:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 10:22:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 10:22:09,494 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 10:22:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:22:09,503 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2021-12-17 10:22:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 10:22:09,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Word has length 11 [2021-12-17 10:22:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:22:09,504 INFO L225 Difference]: With dead ends: 22 [2021-12-17 10:22:09,505 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 10:22:09,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 10:22:09,506 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:22:09,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:22:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 10:22:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 10:22:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 10:22:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 10:22:09,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-12-17 10:22:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:22:09,511 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 10:22:09,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 10:22:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 10:22:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 10:22:09,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:22:09,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:22:09,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 10:22:09,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:22:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:22:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2117156515, now seen corresponding path program 1 times [2021-12-17 10:22:09,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:22:09,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084838079] [2021-12-17 10:22:09,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:09,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:22:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:22:09,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:22:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084838079] [2021-12-17 10:22:09,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084838079] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:22:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39587823] [2021-12-17 10:22:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:09,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:22:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:22:09,599 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 10:22:09,617 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 10:22:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:09,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 10:22:09,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:22:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:22:09,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:22:09,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39587823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:22:09,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 10:22:09,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-12-17 10:22:09,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611014854] [2021-12-17 10:22:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:22:09,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 10:22:09,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:22:09,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 10:22:09,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 10:22:09,758 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 10:22:11,771 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 10:22:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:22:11,855 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2021-12-17 10:22:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 10:22:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Word has length 13 [2021-12-17 10:22:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:22:11,857 INFO L225 Difference]: With dead ends: 28 [2021-12-17 10:22:11,857 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 10:22:11,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 10:22:11,858 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:22:11,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-17 10:22:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 10:22:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-12-17 10:22:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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 10:22:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-12-17 10:22:11,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2021-12-17 10:22:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:22:11,864 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-12-17 10:22:11,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 10:22:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-12-17 10:22:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 10:22:11,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:22:11,865 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:22:11,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 10:22:12,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:22:12,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:22:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:22:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2117216097, now seen corresponding path program 1 times [2021-12-17 10:22:12,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:22:12,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144401396] [2021-12-17 10:22:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:12,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:22:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:22:12,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:22:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144401396] [2021-12-17 10:22:12,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144401396] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:22:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830862032] [2021-12-17 10:22:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:12,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:22:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:22:12,266 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 10:22:12,268 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 10:22:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:12,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 10:22:12,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:22:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:22:27,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:22:31,550 WARN L860 $PredicateComparison]: unable to prove that (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) is different from true [2021-12-17 10:22:35,765 WARN L860 $PredicateComparison]: unable to prove that (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) is different from true [2021-12-17 10:22:37,892 WARN L838 $PredicateComparison]: unable to prove that (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296)) is different from false [2021-12-17 10:22:40,020 WARN L838 $PredicateComparison]: unable to prove that (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296)) is different from false [2021-12-17 10:22:42,123 WARN L860 $PredicateComparison]: unable to prove that (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296)) is different from true [2021-12-17 10:22:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-17 10:22:42,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830862032] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:22:42,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:22:42,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-17 10:22:42,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311080286] [2021-12-17 10:22:42,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:22:42,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 10:22:42,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:22:42,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 10:22:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=70, Unknown=5, NotChecked=76, Total=182 [2021-12-17 10:22:42,130 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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 10:22:44,297 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= |c_ULTIMATE.start_main_~j~0#1| 0) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) is different from false [2021-12-17 10:22:46,434 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 3) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) (= |c_ULTIMATE.start_main_~j~0#1| 3)) is different from false [2021-12-17 10:22:56,975 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 10:22:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:22:57,149 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-12-17 10:22:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 10:22:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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 13 [2021-12-17 10:22:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:22:57,151 INFO L225 Difference]: With dead ends: 30 [2021-12-17 10:22:57,151 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 10:22:57,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=35, Invalid=72, Unknown=7, NotChecked=126, Total=240 [2021-12-17 10:22:57,152 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-17 10:22:57,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 70 Unchecked, 2.2s Time] [2021-12-17 10:22:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 10:22:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-12-17 10:22:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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-12-17 10:22:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-17 10:22:57,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2021-12-17 10:22:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:22:57,158 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-17 10:22:57,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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 10:22:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-17 10:22:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 10:22:57,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:22:57,158 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-17 10:22:57,165 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 10:22:57,359 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,SelfDestructingSolverStorable3 [2021-12-17 10:22:57,359 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:22:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:22:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash -683997770, now seen corresponding path program 2 times [2021-12-17 10:22:57,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:22:57,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750638470] [2021-12-17 10:22:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:22:57,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:22:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:22:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:22:57,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:22:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750638470] [2021-12-17 10:22:57,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750638470] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:22:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207513186] [2021-12-17 10:22:57,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 10:22:57,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:22:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:22:57,624 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 10:22:57,625 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 10:22:57,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 10:22:57,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:22:57,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 10:22:57,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:23:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:23:35,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:23:59,132 WARN L860 $PredicateComparison]: unable to prove that (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296)) is different from true [2021-12-17 10:25:08,633 WARN L860 $PredicateComparison]: unable to prove that (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296)) is different from true [2021-12-17 10:25:10,734 WARN L860 $PredicateComparison]: unable to prove that (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 9) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296)) is different from true [2021-12-17 10:25:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-17 10:25:10,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207513186] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:25:10,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:25:10,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-17 10:25:10,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550540302] [2021-12-17 10:25:10,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:25:10,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 10:25:10,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:25:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 10:25:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=145, Unknown=27, NotChecked=84, Total=306 [2021-12-17 10:25:10,740 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 10:25:12,762 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 10:25:15,009 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= |c_ULTIMATE.start_main_~j~0#1| 0) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296)) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296))) is different from false [2021-12-17 10:25:17,026 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 10:25:33,967 WARN L227 SmtUtils]: Spent 10.51s on a formula simplification. DAG size of input: 23 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:25:36,099 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (<= (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1|) 6) (<= .cse0 (* 2 |c_ULTIMATE.start_main_~j~0#1|)) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) .cse1) (<= (mod (div (mod .cse0 4294967296) 2) 4294967296) .cse1) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|))) is different from false [2021-12-17 10:25:38,229 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (<= (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1|) 6) (<= .cse0 (* 2 |c_ULTIMATE.start_main_~j~0#1|)) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) .cse1) (<= (mod (div (mod .cse0 4294967296) 2) 4294967296) .cse1))) is different from false [2021-12-17 10:25:40,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (<= (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1|) 9) (<= |c_ULTIMATE.start_main_~i~0#1| (* 2 |c_ULTIMATE.start_main_~j~0#1|)) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) .cse0) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) .cse0) (<= 6 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 10:25:59,326 WARN L227 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 20 DAG size of output: 11 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:26:01,333 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 10:26:03,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:05,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:07,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:09,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:11,944 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (<= (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1|) 9) (<= |c_ULTIMATE.start_main_~i~0#1| (* 2 |c_ULTIMATE.start_main_~j~0#1|)) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) .cse0) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) .cse0) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) (<= 6 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 10:26:14,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (<= (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1|) 9) (<= |c_ULTIMATE.start_main_~i~0#1| (* 2 |c_ULTIMATE.start_main_~j~0#1|)) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) .cse0) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) .cse0) (<= 6 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 10:26:35,009 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 10:26:37,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:39,216 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 10:26:43,434 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 10:26:45,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:47,648 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 10:26:49,855 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296) 2) 4294967296) .cse0) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) .cse0) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|))) is different from false [2021-12-17 10:26:51,861 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 10:26:53,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:56,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:26:58,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:00,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:02,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:04,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:06,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:08,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:10,779 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 10:27:12,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:15,087 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296) 2) 4294967296) (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) is different from true [2021-12-17 10:27:17,100 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 10:27:19,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:21,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:23,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:24,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:26,631 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 10:27:28,732 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 10:27:37,155 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 10:27:39,260 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 10:27:41,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:43,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:45,555 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 10:27:47,656 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 10:27:49,767 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 10:27:51,872 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 10:27:53,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:56,083 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 10:27:58,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:27:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:27:58,187 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2021-12-17 10:27:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 10:27:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 18 [2021-12-17 10:27:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:27:58,285 INFO L225 Difference]: With dead ends: 47 [2021-12-17 10:27:58,285 INFO L226 Difference]: Without dead ends: 45 [2021-12-17 10:27:58,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 150.3s TimeCoverageRelationStatistics Valid=102, Invalid=272, Unknown=50, NotChecked=506, Total=930 [2021-12-17 10:27:58,287 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 86.8s IncrementalHoareTripleChecker+Time [2021-12-17 10:27:58,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 41 Unknown, 78 Unchecked, 86.8s Time] [2021-12-17 10:27:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-17 10:27:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2021-12-17 10:27:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 10:27:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-12-17 10:27:58,294 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 18 [2021-12-17 10:27:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:27:58,294 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-12-17 10:27:58,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 10:27:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-12-17 10:27:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 10:27:58,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:27:58,295 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-12-17 10:27:58,319 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-12-17 10:27:58,495 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-12-17 10:27:58,495 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:27:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:27:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1209646399, now seen corresponding path program 3 times [2021-12-17 10:27:58,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:27:58,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798673070] [2021-12-17 10:27:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:27:58,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:27:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:27:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:27:58,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:27:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798673070] [2021-12-17 10:27:58,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798673070] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:27:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479600417] [2021-12-17 10:27:58,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 10:27:58,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:27:58,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:27:58,800 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 10:27:58,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Killed by 15