./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/egcd-ll_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 4aef2940f6d326843487f003443fc222e2136d386047f492f8bd5c7e21afc8f5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:21:41,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:21:41,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:21:41,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:21:41,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:21:41,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:21:41,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:21:41,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:21:41,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:21:41,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:21:41,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:21:41,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:21:41,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:21:41,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:21:41,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:21:41,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:21:41,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:21:41,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:21:41,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:21:41,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:21:41,696 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:21:41,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:21:41,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:21:41,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:21:41,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:21:41,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:21:41,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:21:41,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:21:41,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:21:41,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:21:41,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:21:41,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:21:41,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:21:41,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:21:41,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:21:41,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:21:41,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:21:41,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:21:41,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:21:41,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:21:41,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:21:41,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:21:41,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 03:21:41,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:21:41,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:21:41,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:21:41,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:21:41,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:21:41,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:21:41,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:21:41,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:21:41,750 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:21:41,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:21:41,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:21:41,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 03:21:41,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:21:41,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:21:41,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:21:41,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:21:41,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:21:41,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:21:41,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:21:41,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:21:41,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:21:41,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:21:41,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:21:41,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:21:41,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:21:41,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:21:41,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:21:41,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:21:41,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 03:21:41,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 03:21:41,762 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:21:41,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:21:41,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:21:41,762 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 -> 4aef2940f6d326843487f003443fc222e2136d386047f492f8bd5c7e21afc8f5 [2022-07-21 03:21:42,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:21:42,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:21:42,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:21:42,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:21:42,095 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:21:42,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2022-07-21 03:21:42,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b046119/31cde30ed6da47c8ba0264e107914f14/FLAG1a5b5457b [2022-07-21 03:21:42,545 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:21:42,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2022-07-21 03:21:42,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b046119/31cde30ed6da47c8ba0264e107914f14/FLAG1a5b5457b [2022-07-21 03:21:42,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b046119/31cde30ed6da47c8ba0264e107914f14 [2022-07-21 03:21:42,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:21:42,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:21:42,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:21:42,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:21:42,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:21:42,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c423fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42, skipping insertion in model container [2022-07-21 03:21:42,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:21:42,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:21:42,715 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/egcd-ll_unwindbound20.c[489,502] [2022-07-21 03:21:42,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:21:42,746 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:21:42,784 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/egcd-ll_unwindbound20.c[489,502] [2022-07-21 03:21:42,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:21:42,815 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:21:42,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42 WrapperNode [2022-07-21 03:21:42,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:21:42,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:21:42,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:21:42,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:21:42,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,844 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-07-21 03:21:42,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:21:42,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:21:42,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:21:42,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:21:42,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:21:42,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:21:42,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:21:42,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:21:42,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (1/1) ... [2022-07-21 03:21:42,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:21:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:42,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 03:21:42,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 03:21:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:21:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 03:21:42,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 03:21:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 03:21:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:21:42,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:21:42,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:21:42,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:21:42,995 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:21:42,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:21:43,110 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:21:43,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:21:43,124 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:21:43,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:21:43 BoogieIcfgContainer [2022-07-21 03:21:43,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:21:43,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:21:43,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:21:43,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:21:43,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:21:42" (1/3) ... [2022-07-21 03:21:43,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cf6913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:21:43, skipping insertion in model container [2022-07-21 03:21:43,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:21:42" (2/3) ... [2022-07-21 03:21:43,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cf6913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:21:43, skipping insertion in model container [2022-07-21 03:21:43,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:21:43" (3/3) ... [2022-07-21 03:21:43,145 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.c [2022-07-21 03:21:43,165 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:21:43,166 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:21:43,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:21:43,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39a91129, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@156d15a1 [2022-07-21 03:21:43,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:21:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 03:21:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 03:21:43,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:43,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:43,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2022-07-21 03:21:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:43,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394177706] [2022-07-21 03:21:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 03:21:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 03:21:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 03:21:43,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394177706] [2022-07-21 03:21:43,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394177706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:43,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:43,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 03:21:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050743373] [2022-07-21 03:21:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:43,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 03:21:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:43,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 03:21:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:21:43,427 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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) [2022-07-21 03:21:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:43,447 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-07-21 03:21:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 03:21:43,449 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 [2022-07-21 03:21:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:43,453 INFO L225 Difference]: With dead ends: 57 [2022-07-21 03:21:43,454 INFO L226 Difference]: Without dead ends: 26 [2022-07-21 03:21:43,457 INFO L412 NwaCegarLoop]: 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 [2022-07-21 03:21:43,461 INFO L413 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:43,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:21:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-21 03:21:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-21 03:21:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:21:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-07-21 03:21:43,494 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-07-21 03:21:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:43,494 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-21 03:21:43,495 INFO L496 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) [2022-07-21 03:21:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-07-21 03:21:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 03:21:43,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:43,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:43,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 03:21:43,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2022-07-21 03:21:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:43,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426717388] [2022-07-21 03:21:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 03:21:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 03:21:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 03:21:43,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:43,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426717388] [2022-07-21 03:21:43,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426717388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:43,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:43,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 03:21:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306284140] [2022-07-21 03:21:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 03:21:43,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 03:21:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 03:21:43,635 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-07-21 03:21:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:43,665 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-07-21 03:21:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 03:21:43,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2022-07-21 03:21:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:43,667 INFO L225 Difference]: With dead ends: 38 [2022-07-21 03:21:43,667 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 03:21:43,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 03:21:43,669 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 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 [2022-07-21 03:21:43,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:21:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 03:21:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-21 03:21:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:21:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-07-21 03:21:43,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-07-21 03:21:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:43,684 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-21 03:21:43,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-07-21 03:21:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-07-21 03:21:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 03:21:43,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:43,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:43,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 03:21:43,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2022-07-21 03:21:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:43,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135578406] [2022-07-21 03:21:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:43,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:43,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838552289] [2022-07-21 03:21:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:43,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:43,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:43,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 03:21:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:43,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:21:43,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 03:21:43,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:21:43,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:43,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135578406] [2022-07-21 03:21:43,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:43,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838552289] [2022-07-21 03:21:43,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838552289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:43,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:21:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375086844] [2022-07-21 03:21:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:43,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:21:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:21:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:21:43,859 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2022-07-21 03:21:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:43,943 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-07-21 03:21:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:21:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 [2022-07-21 03:21:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:43,945 INFO L225 Difference]: With dead ends: 45 [2022-07-21 03:21:43,945 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 03:21:43,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 03:21:43,946 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:43,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:21:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 03:21:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-21 03:21:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 03:21:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2022-07-21 03:21:43,961 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2022-07-21 03:21:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:43,961 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-07-21 03:21:43,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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) [2022-07-21 03:21:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2022-07-21 03:21:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 03:21:43,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:43,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:43,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:44,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:44,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2022-07-21 03:21:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:44,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796312444] [2022-07-21 03:21:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:44,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:44,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331761068] [2022-07-21 03:21:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:44,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:44,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:44,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:44,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 03:21:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:44,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 03:21:44,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 03:21:44,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:21:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:44,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796312444] [2022-07-21 03:21:44,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:44,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331761068] [2022-07-21 03:21:44,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331761068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:44,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:44,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 03:21:44,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842068030] [2022-07-21 03:21:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:44,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 03:21:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:44,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 03:21:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 03:21:44,365 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 03:21:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:44,509 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-07-21 03:21:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:21:44,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-07-21 03:21:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:44,514 INFO L225 Difference]: With dead ends: 49 [2022-07-21 03:21:44,515 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 03:21:44,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:21:44,518 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:44,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:21:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 03:21:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-21 03:21:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 03:21:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-07-21 03:21:44,536 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-07-21 03:21:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:44,536 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-07-21 03:21:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 03:21:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-07-21 03:21:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 03:21:44,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:44,538 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:44,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 03:21:44,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 03:21:44,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:44,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2022-07-21 03:21:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:44,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891699321] [2022-07-21 03:21:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:44,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:44,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1057573083] [2022-07-21 03:21:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:44,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:44,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:44,766 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) [2022-07-21 03:21:44,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 03:21:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:44,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 03:21:44,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 03:21:44,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:21:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891699321] [2022-07-21 03:21:44,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:44,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057573083] [2022-07-21 03:21:44,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057573083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:44,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:44,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 03:21:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131826460] [2022-07-21 03:21:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:44,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 03:21:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 03:21:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 03:21:44,965 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 03:21:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:45,091 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-07-21 03:21:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 03:21:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-07-21 03:21:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:45,098 INFO L225 Difference]: With dead ends: 71 [2022-07-21 03:21:45,099 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 03:21:45,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 03:21:45,099 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:45,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:21:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 03:21:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-21 03:21:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-21 03:21:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-07-21 03:21:45,108 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2022-07-21 03:21:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:45,109 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-07-21 03:21:45,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 03:21:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-07-21 03:21:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 03:21:45,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:45,110 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:45,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 03:21:45,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:45,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2022-07-21 03:21:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:45,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922755732] [2022-07-21 03:21:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:45,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003265639] [2022-07-21 03:21:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:45,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:45,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:45,337 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) [2022-07-21 03:21:45,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 03:21:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:45,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 03:21:45,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 03:21:45,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:21:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922755732] [2022-07-21 03:21:45,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:45,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003265639] [2022-07-21 03:21:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003265639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:45,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:45,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:21:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479263191] [2022-07-21 03:21:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:45,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:21:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:21:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:21:45,393 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 03:21:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:45,430 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2022-07-21 03:21:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:21:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-07-21 03:21:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:45,433 INFO L225 Difference]: With dead ends: 83 [2022-07-21 03:21:45,433 INFO L226 Difference]: Without dead ends: 81 [2022-07-21 03:21:45,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 03:21:45,435 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:45,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:21:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-21 03:21:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-07-21 03:21:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-21 03:21:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-07-21 03:21:45,461 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2022-07-21 03:21:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:45,462 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-07-21 03:21:45,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 03:21:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-07-21 03:21:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 03:21:45,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:45,465 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:45,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:45,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:45,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2022-07-21 03:21:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:45,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156667515] [2022-07-21 03:21:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:45,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:45,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344641141] [2022-07-21 03:21:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:45,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:45,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:45,696 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) [2022-07-21 03:21:45,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 03:21:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:45,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 03:21:45,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 03:21:45,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:21:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 03:21:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156667515] [2022-07-21 03:21:45,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344641141] [2022-07-21 03:21:45,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344641141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:21:45,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:21:45,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-21 03:21:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414665454] [2022-07-21 03:21:45,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:21:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:21:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:21:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:21:45,852 INFO L87 Difference]: Start difference. First operand 74 states and 105 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, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-21 03:21:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:45,952 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-07-21 03:21:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 03:21:45,952 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, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 38 [2022-07-21 03:21:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:45,953 INFO L225 Difference]: With dead ends: 218 [2022-07-21 03:21:45,953 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 03:21:45,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:21:45,954 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:45,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:21:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 03:21:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2022-07-21 03:21:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-21 03:21:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-21 03:21:45,970 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2022-07-21 03:21:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:45,971 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-21 03:21:45,971 INFO L496 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, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-21 03:21:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-21 03:21:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 03:21:45,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:45,971 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:45,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:46,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:46,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2022-07-21 03:21:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:46,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784075128] [2022-07-21 03:21:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:46,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:46,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664755214] [2022-07-21 03:21:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:46,184 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) [2022-07-21 03:21:46,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 03:21:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:46,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 03:21:46,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 03:21:46,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:21:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:46,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784075128] [2022-07-21 03:21:46,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:46,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664755214] [2022-07-21 03:21:46,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664755214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:21:46,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:21:46,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 03:21:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685997678] [2022-07-21 03:21:46,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:21:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:21:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 03:21:46,323 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 03:21:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:46,367 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2022-07-21 03:21:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:21:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-07-21 03:21:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:46,370 INFO L225 Difference]: With dead ends: 204 [2022-07-21 03:21:46,370 INFO L226 Difference]: Without dead ends: 199 [2022-07-21 03:21:46,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 03:21:46,373 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:46,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:21:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-21 03:21:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-21 03:21:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-07-21 03:21:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2022-07-21 03:21:46,393 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2022-07-21 03:21:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:46,393 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2022-07-21 03:21:46,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 03:21:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2022-07-21 03:21:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 03:21:46,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:46,394 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:46,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:46,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2022-07-21 03:21:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794936813] [2022-07-21 03:21:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:46,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:46,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829267092] [2022-07-21 03:21:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:46,616 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) [2022-07-21 03:21:46,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 03:21:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:46,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 03:21:46,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 03:21:46,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:21:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 03:21:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:46,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794936813] [2022-07-21 03:21:46,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:46,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829267092] [2022-07-21 03:21:46,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829267092] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:21:46,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:21:46,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-07-21 03:21:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255949827] [2022-07-21 03:21:46,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:21:46,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 03:21:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 03:21:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 03:21:46,799 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 03:21:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:46,912 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2022-07-21 03:21:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:21:46,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2022-07-21 03:21:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:46,914 INFO L225 Difference]: With dead ends: 228 [2022-07-21 03:21:46,914 INFO L226 Difference]: Without dead ends: 212 [2022-07-21 03:21:46,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-21 03:21:46,915 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:46,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 84 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:21:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-21 03:21:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-07-21 03:21:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 138 states have internal predecessors, (148), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2022-07-21 03:21:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2022-07-21 03:21:46,928 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2022-07-21 03:21:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:46,928 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2022-07-21 03:21:46,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 03:21:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-07-21 03:21:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 03:21:46,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:46,929 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:46,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:47,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:47,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2022-07-21 03:21:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:47,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956365475] [2022-07-21 03:21:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:47,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:47,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711274416] [2022-07-21 03:21:47,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:21:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:47,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:47,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 03:21:47,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:21:47,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:21:47,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 03:21:47,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 03:21:47,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:21:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 03:21:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:47,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956365475] [2022-07-21 03:21:47,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:47,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711274416] [2022-07-21 03:21:47,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711274416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:21:47,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:21:47,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-21 03:21:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137307769] [2022-07-21 03:21:47,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:21:47,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:21:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:21:47,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:21:47,394 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 03:21:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:47,869 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-07-21 03:21:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 03:21:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2022-07-21 03:21:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:47,871 INFO L225 Difference]: With dead ends: 249 [2022-07-21 03:21:47,871 INFO L226 Difference]: Without dead ends: 225 [2022-07-21 03:21:47,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:21:47,872 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:47,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 03:21:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-21 03:21:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2022-07-21 03:21:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 141 states have internal predecessors, (150), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-21 03:21:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2022-07-21 03:21:47,889 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2022-07-21 03:21:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:47,889 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2022-07-21 03:21:47,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 03:21:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2022-07-21 03:21:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 03:21:47,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:47,891 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:47,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 03:21:48,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 03:21:48,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:48,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2022-07-21 03:21:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:48,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612257533] [2022-07-21 03:21:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:48,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:48,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912871389] [2022-07-21 03:21:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:48,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:48,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 03:21:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:21:48,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 03:21:48,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 03:21:48,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:21:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-21 03:21:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612257533] [2022-07-21 03:21:48,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912871389] [2022-07-21 03:21:48,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912871389] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 03:21:48,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 03:21:48,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-07-21 03:21:48,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223409206] [2022-07-21 03:21:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:21:48,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 03:21:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:48,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 03:21:48,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:21:48,418 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 03:21:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:48,468 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2022-07-21 03:21:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 03:21:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-21 03:21:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:48,472 INFO L225 Difference]: With dead ends: 212 [2022-07-21 03:21:48,472 INFO L226 Difference]: Without dead ends: 188 [2022-07-21 03:21:48,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 03:21:48,473 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:48,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:21:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-21 03:21:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2022-07-21 03:21:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-21 03:21:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2022-07-21 03:21:48,489 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2022-07-21 03:21:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:48,490 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2022-07-21 03:21:48,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 03:21:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2022-07-21 03:21:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 03:21:48,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:48,493 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:48,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:48,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:48,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2022-07-21 03:21:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:48,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988592451] [2022-07-21 03:21:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:48,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:48,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:48,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113878828] [2022-07-21 03:21:48,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:21:48,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:48,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:48,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:48,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 03:21:48,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:21:48,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:21:48,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 03:21:48,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-21 03:21:48,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:21:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-21 03:21:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:48,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988592451] [2022-07-21 03:21:48,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:48,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113878828] [2022-07-21 03:21:48,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113878828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:21:48,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:21:48,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-21 03:21:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166136852] [2022-07-21 03:21:48,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:21:48,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 03:21:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 03:21:48,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-21 03:21:48,978 INFO L87 Difference]: Start difference. First operand 185 states and 208 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, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-07-21 03:21:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:49,155 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2022-07-21 03:21:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 03:21:49,155 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, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 95 [2022-07-21 03:21:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:49,158 INFO L225 Difference]: With dead ends: 512 [2022-07-21 03:21:49,158 INFO L226 Difference]: Without dead ends: 503 [2022-07-21 03:21:49,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-21 03:21:49,159 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 97 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:49,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 207 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:21:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-07-21 03:21:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-07-21 03:21:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2022-07-21 03:21:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2022-07-21 03:21:49,211 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2022-07-21 03:21:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:49,211 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2022-07-21 03:21:49,212 INFO L496 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, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-07-21 03:21:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2022-07-21 03:21:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-21 03:21:49,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:49,218 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:49,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:49,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 03:21:49,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2022-07-21 03:21:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:49,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821467346] [2022-07-21 03:21:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:49,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:49,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926605870] [2022-07-21 03:21:49,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:21:49,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:49,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:49,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 03:21:49,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-07-21 03:21:49,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:21:49,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 03:21:49,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:21:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-21 03:21:49,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:21:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2022-07-21 03:21:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:21:50,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821467346] [2022-07-21 03:21:50,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:21:50,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926605870] [2022-07-21 03:21:50,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926605870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:21:50,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:21:50,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-21 03:21:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351745244] [2022-07-21 03:21:50,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:21:50,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 03:21:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:21:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 03:21:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-07-21 03:21:50,116 INFO L87 Difference]: Start difference. First operand 503 states and 568 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, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2022-07-21 03:21:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:21:50,591 INFO L93 Difference]: Finished difference Result 1042 states and 1217 transitions. [2022-07-21 03:21:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 03:21:50,592 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, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) Word has length 209 [2022-07-21 03:21:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:21:50,596 INFO L225 Difference]: With dead ends: 1042 [2022-07-21 03:21:50,596 INFO L226 Difference]: Without dead ends: 1033 [2022-07-21 03:21:50,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 03:21:50,597 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 206 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:21:50,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 318 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 03:21:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-07-21 03:21:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2022-07-21 03:21:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 684 states have (on average 1.090643274853801) internal successors, (746), 704 states have internal predecessors, (746), 212 states have call successors, (212), 136 states have call predecessors, (212), 136 states have return successors, (210), 192 states have call predecessors, (210), 210 states have call successors, (210) [2022-07-21 03:21:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1168 transitions. [2022-07-21 03:21:50,662 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1168 transitions. Word has length 209 [2022-07-21 03:21:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:21:50,663 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1168 transitions. [2022-07-21 03:21:50,663 INFO L496 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, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2022-07-21 03:21:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1168 transitions. [2022-07-21 03:21:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2022-07-21 03:21:50,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:21:50,668 INFO L195 NwaCegarLoop]: trace histogram [61, 60, 60, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:50,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:50,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 03:21:50,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:21:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:21:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1625381426, now seen corresponding path program 4 times [2022-07-21 03:21:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:21:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317393076] [2022-07-21 03:21:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:21:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:21:50,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:21:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529817306] [2022-07-21 03:21:50,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 03:21:50,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:21:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:21:50,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:21:50,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 03:21:51,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 03:21:51,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-21 03:21:51,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 03:21:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:21:51,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 03:21:51,289 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 03:21:51,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 03:21:51,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 03:21:51,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 03:21:51,510 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:21:51,513 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 03:21:51,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:21:51 BoogieIcfgContainer [2022-07-21 03:21:51,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 03:21:51,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 03:21:51,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 03:21:51,648 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 03:21:51,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:21:43" (3/4) ... [2022-07-21 03:21:51,649 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 03:21:51,728 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 03:21:51,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 03:21:51,731 INFO L158 Benchmark]: Toolchain (without parser) took 9163.19ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 58.0MB in the beginning and 69.7MB in the end (delta: -11.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,731 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 73.4MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:21:51,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.82ms. Allocated memory is still 73.4MB. Free memory was 57.8MB in the beginning and 56.9MB in the end (delta: 913.1kB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.36ms. Allocated memory is still 73.4MB. Free memory was 56.9MB in the beginning and 55.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,732 INFO L158 Benchmark]: Boogie Preprocessor took 37.63ms. Allocated memory is still 73.4MB. Free memory was 55.4MB in the beginning and 54.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,732 INFO L158 Benchmark]: RCFGBuilder took 246.68ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 44.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,733 INFO L158 Benchmark]: TraceAbstraction took 8515.50ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 43.9MB in the beginning and 83.4MB in the end (delta: -39.5MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,733 INFO L158 Benchmark]: Witness Printer took 83.08ms. Allocated memory is still 130.0MB. Free memory was 83.4MB in the beginning and 69.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 03:21:51,734 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.16ms. Allocated memory is still 73.4MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.82ms. Allocated memory is still 73.4MB. Free memory was 57.8MB in the beginning and 56.9MB in the end (delta: 913.1kB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.36ms. Allocated memory is still 73.4MB. Free memory was 56.9MB in the beginning and 55.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.63ms. Allocated memory is still 73.4MB. Free memory was 55.4MB in the beginning and 54.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 246.68ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 44.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8515.50ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 43.9MB in the beginning and 83.4MB in the end (delta: -39.5MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * Witness Printer took 83.08ms. Allocated memory is still 130.0MB. Free memory was 83.4MB in the beginning and 69.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=43, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=43, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=43, b=2, counter=0, p=1, q=0, r=0, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=2, counter=1, p=1, q=0, r=-1, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=2, counter=2, p=1, q=0, r=-2, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=2, counter=3, p=1, q=0, r=-3, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=2, counter=4, p=1, q=0, r=-4, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=2, counter=5, p=1, q=0, r=-5, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=2, counter=6, p=1, q=0, r=-6, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=2, counter=7, p=1, q=0, r=-7, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=2, counter=8, p=1, q=0, r=-8, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=2, counter=9, p=1, q=0, r=-9, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=2, counter=10, p=1, q=0, r=-10, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=2, counter=11, p=1, q=0, r=-11, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=2, counter=12, p=1, q=0, r=-12, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=2, counter=13, p=1, q=0, r=-13, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=2, counter=14, p=1, q=0, r=-14, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=2, counter=15, p=1, q=0, r=-15, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=2, counter=16, p=1, q=0, r=-16, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=2, counter=17, p=1, q=0, r=-17, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=2, counter=18, p=1, q=0, r=-18, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=2, counter=19, p=1, q=0, r=-19, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=2, counter=20, p=1, q=0, r=-20, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=43, y=2] [L34] COND FALSE !(counter++<20) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 14, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 488 mSDsluCounter, 1826 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1288 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1092 IncrementalHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 538 mSDtfsCounter, 1092 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1152 GetRequests, 1015 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1033occurred in iteration=13, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 3289 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 2772/5417 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! [2022-07-21 03:21:51,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE