./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.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/nla-digbench-scaling/mannadiv_unwindbound20.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 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 13:45:23,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 13:45:23,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 13:45:23,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 13:45:23,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 13:45:23,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 13:45:23,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 13:45:23,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 13:45:23,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 13:45:23,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 13:45:23,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 13:45:23,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 13:45:23,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 13:45:23,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 13:45:23,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 13:45:23,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 13:45:23,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 13:45:23,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 13:45:23,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 13:45:23,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 13:45:23,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 13:45:23,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 13:45:23,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 13:45:23,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 13:45:23,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 13:45:23,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 13:45:23,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 13:45:23,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 13:45:23,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 13:45:23,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 13:45:23,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 13:45:23,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 13:45:23,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 13:45:23,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 13:45:23,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 13:45:23,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 13:45:23,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 13:45:23,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 13:45:23,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 13:45:23,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 13:45:23,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 13:45:23,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 13:45:23,797 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 13:45:23,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 13:45:23,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 13:45:23,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 13:45:23,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 13:45:23,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 13:45:23,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 13:45:23,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 13:45:23,802 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 13:45:23,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 13:45:23,802 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 13:45:23,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 13:45:23,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 13:45:23,803 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 13:45:23,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 13:45:23,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 13:45:23,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 13:45:23,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 13:45:23,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 13:45:23,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 13:45:23,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 13:45:23,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 13:45:23,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 13:45:23,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 13:45:23,805 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 13:45:23,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 13:45:23,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 13:45:23,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 13:45:23,806 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 -> 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa [2021-12-17 13:45:24,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 13:45:24,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 13:45:24,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 13:45:24,046 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 13:45:24,046 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 13:45:24,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2021-12-17 13:45:24,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f80f8eee/7a156d31450045748879682e15bd4584/FLAGa09213d9b [2021-12-17 13:45:24,462 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 13:45:24,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2021-12-17 13:45:24,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f80f8eee/7a156d31450045748879682e15bd4584/FLAGa09213d9b [2021-12-17 13:45:24,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f80f8eee/7a156d31450045748879682e15bd4584 [2021-12-17 13:45:24,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 13:45:24,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 13:45:24,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 13:45:24,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 13:45:24,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 13:45:24,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:45:24" (1/1) ... [2021-12-17 13:45:24,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16dad1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:24, skipping insertion in model container [2021-12-17 13:45:24,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:45:24" (1/1) ... [2021-12-17 13:45:24,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 13:45:24,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 13:45:25,016 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/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2021-12-17 13:45:25,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 13:45:25,035 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 13:45:25,045 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/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2021-12-17 13:45:25,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 13:45:25,063 INFO L208 MainTranslator]: Completed translation [2021-12-17 13:45:25,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25 WrapperNode [2021-12-17 13:45:25,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 13:45:25,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 13:45:25,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 13:45:25,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 13:45:25,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,110 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2021-12-17 13:45:25,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 13:45:25,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 13:45:25,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 13:45:25,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 13:45:25,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 13:45:25,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 13:45:25,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 13:45:25,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 13:45:25,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (1/1) ... [2021-12-17 13:45:25,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 13:45:25,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:25,172 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 13:45:25,178 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 13:45:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 13:45:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 13:45:25,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 13:45:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 13:45:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 13:45:25,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 13:45:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 13:45:25,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 13:45:25,249 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 13:45:25,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 13:45:25,321 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 13:45:25,325 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 13:45:25,325 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 13:45:25,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:45:25 BoogieIcfgContainer [2021-12-17 13:45:25,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 13:45:25,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 13:45:25,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 13:45:25,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 13:45:25,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 01:45:24" (1/3) ... [2021-12-17 13:45:25,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cef3853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:45:25, skipping insertion in model container [2021-12-17 13:45:25,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:25" (2/3) ... [2021-12-17 13:45:25,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cef3853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:45:25, skipping insertion in model container [2021-12-17 13:45:25,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:45:25" (3/3) ... [2021-12-17 13:45:25,331 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2021-12-17 13:45:25,334 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 13:45:25,335 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 13:45:25,402 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 13:45:25,406 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 13:45:25,407 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 13:45:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 13:45:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 13:45:25,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:25,420 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:25,420 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2021-12-17 13:45:25,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:25,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343292223] [2021-12-17 13:45:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:25,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 13:45:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 13:45:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:25,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343292223] [2021-12-17 13:45:25,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343292223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:25,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:25,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 13:45:25,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259505920] [2021-12-17 13:45:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:25,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 13:45:25,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 13:45:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 13:45:25,612 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:25,626 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-12-17 13:45:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 13:45:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-12-17 13:45:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:25,634 INFO L225 Difference]: With dead ends: 47 [2021-12-17 13:45:25,634 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 13:45:25,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 13:45:25,641 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:25,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 13:45:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 13:45:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-17 13:45:25,678 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2021-12-17 13:45:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:25,678 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-17 13:45:25,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-17 13:45:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 13:45:25,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:25,680 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:25,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 13:45:25,681 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2021-12-17 13:45:25,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754001312] [2021-12-17 13:45:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:25,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:25,712 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:25,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913076729] [2021-12-17 13:45:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:25,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:25,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:25,727 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 13:45:25,736 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 13:45:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:25,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 13:45:25,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:25,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 13:45:25,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754001312] [2021-12-17 13:45:25,920 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913076729] [2021-12-17 13:45:25,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913076729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:25,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:25,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 13:45:25,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97336507] [2021-12-17 13:45:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:25,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 13:45:25,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 13:45:25,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 13:45:25,926 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 13:45:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:25,949 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-12-17 13:45:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 13:45:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-12-17 13:45:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:25,956 INFO L225 Difference]: With dead ends: 30 [2021-12-17 13:45:25,957 INFO L226 Difference]: Without dead ends: 23 [2021-12-17 13:45:25,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 13:45:25,958 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:25,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-17 13:45:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-17 13:45:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-17 13:45:25,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2021-12-17 13:45:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:25,969 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-17 13:45:25,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 13:45:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-17 13:45:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 13:45:25,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:25,970 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:25,998 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 13:45:26,198 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 13:45:26,198 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2021-12-17 13:45:26,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:26,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203574972] [2021-12-17 13:45:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:26,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:26,227 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:26,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291027297] [2021-12-17 13:45:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:26,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:26,228 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 13:45:26,247 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 13:45:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:26,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 13:45:26,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 13:45:26,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 13:45:26,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:26,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203574972] [2021-12-17 13:45:26,431 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:26,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291027297] [2021-12-17 13:45:26,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291027297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:26,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:26,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 13:45:26,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664001266] [2021-12-17 13:45:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:26,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 13:45:26,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 13:45:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 13:45:26,433 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 13:45:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:26,489 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-17 13:45:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 13:45:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-12-17 13:45:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:26,491 INFO L225 Difference]: With dead ends: 33 [2021-12-17 13:45:26,491 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 13:45:26,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-17 13:45:26,492 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:26,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 13:45:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-17 13:45:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 13:45:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-17 13:45:26,497 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2021-12-17 13:45:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:26,497 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-17 13:45:26,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 13:45:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-17 13:45:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 13:45:26,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:26,499 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:26,531 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 13:45:26,716 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 13:45:26,716 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2021-12-17 13:45:26,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:26,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661011534] [2021-12-17 13:45:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:26,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:26,740 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:26,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649986740] [2021-12-17 13:45:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:26,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:26,743 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 13:45:26,759 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 13:45:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:26,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 13:45:26,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:26,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:26,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661011534] [2021-12-17 13:45:26,970 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649986740] [2021-12-17 13:45:26,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649986740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:26,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:26,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-17 13:45:26,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770975724] [2021-12-17 13:45:26,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:26,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 13:45:26,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 13:45:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 13:45:26,973 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 13:45:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:27,029 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2021-12-17 13:45:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 13:45:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2021-12-17 13:45:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:27,031 INFO L225 Difference]: With dead ends: 35 [2021-12-17 13:45:27,031 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 13:45:27,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-17 13:45:27,032 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:27,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 13:45:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-17 13:45:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-17 13:45:27,036 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2021-12-17 13:45:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:27,037 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-17 13:45:27,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 13:45:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-17 13:45:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 13:45:27,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:27,038 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:27,077 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 13:45:27,278 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 13:45:27,279 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2021-12-17 13:45:27,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557699589] [2021-12-17 13:45:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:27,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:27,286 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:27,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722700420] [2021-12-17 13:45:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:27,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:27,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:27,309 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 13:45:27,311 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 13:45:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:27,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 13:45:27,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:27,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:27,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:27,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557699589] [2021-12-17 13:45:27,464 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:27,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722700420] [2021-12-17 13:45:27,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722700420] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:27,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:27,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-17 13:45:27,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859105378] [2021-12-17 13:45:27,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:27,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 13:45:27,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 13:45:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-17 13:45:27,466 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 13:45:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:27,513 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2021-12-17 13:45:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 13:45:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2021-12-17 13:45:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:27,514 INFO L225 Difference]: With dead ends: 57 [2021-12-17 13:45:27,514 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 13:45:27,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 13:45:27,515 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:27,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 13:45:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-17 13:45:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 13:45:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-12-17 13:45:27,521 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2021-12-17 13:45:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:27,521 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-12-17 13:45:27,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 13:45:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-12-17 13:45:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-17 13:45:27,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:27,522 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:27,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 13:45:27,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:27,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:27,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2021-12-17 13:45:27,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:27,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552132733] [2021-12-17 13:45:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:27,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:27,753 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:27,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851914780] [2021-12-17 13:45:27,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 13:45:27,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:27,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:27,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 13:45:27,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 13:45:27,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 13:45:27,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 13:45:27,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 13:45:27,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:27,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 13:45:28,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:28,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552132733] [2021-12-17 13:45:28,012 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851914780] [2021-12-17 13:45:28,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851914780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:28,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:28,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-17 13:45:28,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049263760] [2021-12-17 13:45:28,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:28,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 13:45:28,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:28,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 13:45:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-17 13:45:28,015 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-17 13:45:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:28,138 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2021-12-17 13:45:28,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 13:45:28,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2021-12-17 13:45:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:28,140 INFO L225 Difference]: With dead ends: 111 [2021-12-17 13:45:28,140 INFO L226 Difference]: Without dead ends: 106 [2021-12-17 13:45:28,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-17 13:45:28,141 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:28,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 175 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 13:45:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-17 13:45:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-17 13:45:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-17 13:45:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2021-12-17 13:45:28,149 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2021-12-17 13:45:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:28,150 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2021-12-17 13:45:28,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-17 13:45:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2021-12-17 13:45:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-17 13:45:28,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:28,151 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:28,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 13:45:28,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:28,368 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2021-12-17 13:45:28,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:28,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561620384] [2021-12-17 13:45:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:28,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:28,376 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:28,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747983233] [2021-12-17 13:45:28,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 13:45:28,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:28,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:28,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 13:45:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 13:45:28,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-17 13:45:28,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 13:45:28,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 13:45:28,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:28,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-12-17 13:45:29,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561620384] [2021-12-17 13:45:29,179 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747983233] [2021-12-17 13:45:29,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747983233] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:29,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:29,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-17 13:45:29,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278555756] [2021-12-17 13:45:29,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:29,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 13:45:29,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 13:45:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2021-12-17 13:45:29,182 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2021-12-17 13:45:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:29,489 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2021-12-17 13:45:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-17 13:45:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) Word has length 109 [2021-12-17 13:45:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:29,491 INFO L225 Difference]: With dead ends: 201 [2021-12-17 13:45:29,491 INFO L226 Difference]: Without dead ends: 196 [2021-12-17 13:45:29,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 13:45:29,492 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 198 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:29,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 226 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 13:45:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-17 13:45:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-17 13:45:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-17 13:45:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2021-12-17 13:45:29,505 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2021-12-17 13:45:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:29,506 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2021-12-17 13:45:29,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2021-12-17 13:45:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2021-12-17 13:45:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-17 13:45:29,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:29,508 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:29,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 13:45:29,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:29,724 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2021-12-17 13:45:29,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:29,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81655001] [2021-12-17 13:45:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:29,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:29,742 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:29,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25344223] [2021-12-17 13:45:29,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 13:45:29,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:29,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:29,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 13:45:29,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 13:45:29,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 13:45:29,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-17 13:45:29,832 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 13:45:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 13:45:29,930 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 13:45:29,930 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 13:45:29,931 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 13:45:30,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 13:45:30,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:30,212 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2021-12-17 13:45:30,214 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 13:45:30,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 01:45:30 BoogieIcfgContainer [2021-12-17 13:45:30,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 13:45:30,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 13:45:30,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 13:45:30,276 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 13:45:30,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:45:25" (3/4) ... [2021-12-17 13:45:30,278 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 13:45:30,356 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 13:45:30,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 13:45:30,356 INFO L158 Benchmark]: Toolchain (without parser) took 5469.32ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 100.0MB in the beginning and 77.0MB in the end (delta: 23.0MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2021-12-17 13:45:30,357 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 13:45:30,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.00ms. Allocated memory is still 130.0MB. Free memory was 100.0MB in the beginning and 105.0MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 13:45:30,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.82ms. Allocated memory is still 130.0MB. Free memory was 105.0MB in the beginning and 103.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 13:45:30,357 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 130.0MB. Free memory was 103.8MB in the beginning and 102.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 13:45:30,358 INFO L158 Benchmark]: RCFGBuilder took 177.83ms. Allocated memory is still 130.0MB. Free memory was 102.6MB in the beginning and 93.3MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 13:45:30,358 INFO L158 Benchmark]: TraceAbstraction took 4948.59ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 92.9MB in the beginning and 86.4MB in the end (delta: 6.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2021-12-17 13:45:30,358 INFO L158 Benchmark]: Witness Printer took 79.83ms. Allocated memory is still 157.3MB. Free memory was 86.4MB in the beginning and 77.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 13:45:30,359 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.00ms. Allocated memory is still 130.0MB. Free memory was 100.0MB in the beginning and 105.0MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.82ms. Allocated memory is still 130.0MB. Free memory was 105.0MB in the beginning and 103.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 130.0MB. Free memory was 103.8MB in the beginning and 102.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 177.83ms. Allocated memory is still 130.0MB. Free memory was 102.6MB in the beginning and 93.3MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4948.59ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 92.9MB in the beginning and 86.4MB in the end (delta: 6.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 79.83ms. Allocated memory is still 157.3MB. Free memory was 86.4MB in the beginning and 77.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] EXPR counter++ VAL [counter=1, counter++=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] EXPR counter++ VAL [counter=2, counter++=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] EXPR counter++ VAL [counter=3, counter++=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] EXPR counter++ VAL [counter=4, counter++=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] EXPR counter++ VAL [counter=5, counter++=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] EXPR counter++ VAL [counter=6, counter++=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] EXPR counter++ VAL [counter=7, counter++=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] EXPR counter++ VAL [counter=8, counter++=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] EXPR counter++ VAL [counter=9, counter++=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] EXPR counter++ VAL [counter=10, counter++=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=11, counter++=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] EXPR counter++ VAL [counter=12, counter++=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] EXPR counter++ VAL [counter=13, counter++=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] EXPR counter++ VAL [counter=14, counter++=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] EXPR counter++ VAL [counter=15, counter++=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] EXPR counter++ VAL [counter=16, counter++=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] EXPR counter++ VAL [counter=17, counter++=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] EXPR counter++ VAL [counter=18, counter++=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] EXPR counter++ VAL [counter=19, counter++=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=20, counter++=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=21, counter++=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 753 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 571 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 336 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 182 mSDtfsCounter, 336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 410 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=7, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1209 SizeOfPredicates, 25 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 13:45:30,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE