./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/prod4br-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 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 17:01:37,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 17:01:37,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 17:01:37,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 17:01:37,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 17:01:37,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 17:01:37,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 17:01:37,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 17:01:37,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 17:01:37,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 17:01:37,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 17:01:37,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 17:01:37,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 17:01:37,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 17:01:37,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 17:01:37,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 17:01:37,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 17:01:37,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 17:01:38,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 17:01:38,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 17:01:38,002 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 17:01:38,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 17:01:38,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 17:01:38,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 17:01:38,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 17:01:38,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 17:01:38,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 17:01:38,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 17:01:38,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 17:01:38,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 17:01:38,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 17:01:38,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 17:01:38,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 17:01:38,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 17:01:38,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 17:01:38,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 17:01:38,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 17:01:38,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 17:01:38,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 17:01:38,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 17:01:38,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 17:01:38,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 17:01:38,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 17:01:38,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 17:01:38,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 17:01:38,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 17:01:38,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 17:01:38,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 17:01:38,039 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 17:01:38,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 17:01:38,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 17:01:38,040 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 17:01:38,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 17:01:38,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 17:01:38,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 17:01:38,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 17:01:38,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 17:01:38,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 17:01:38,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 17:01:38,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 17:01:38,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 17:01:38,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 17:01:38,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 17:01:38,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 17:01:38,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 17:01:38,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 17:01:38,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 17:01:38,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 17:01:38,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 17:01:38,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 17:01:38,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 17:01:38,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 17:01:38,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 17:01:38,044 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 17:01:38,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 17:01:38,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 17:01:38,044 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 -> 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca [2022-07-13 17:01:38,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 17:01:38,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 17:01:38,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 17:01:38,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 17:01:38,237 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 17:01:38,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2022-07-13 17:01:38,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8675fb1/c369b905686f4a9db12b72a18d5d8a7b/FLAGba5f56e63 [2022-07-13 17:01:38,669 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 17:01:38,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2022-07-13 17:01:38,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8675fb1/c369b905686f4a9db12b72a18d5d8a7b/FLAGba5f56e63 [2022-07-13 17:01:38,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8675fb1/c369b905686f4a9db12b72a18d5d8a7b [2022-07-13 17:01:38,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 17:01:38,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 17:01:38,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 17:01:38,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 17:01:38,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 17:01:38,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7462c4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38, skipping insertion in model container [2022-07-13 17:01:38,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 17:01:38,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 17:01:38,815 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/prod4br-ll_unwindbound20.c[524,537] [2022-07-13 17:01:38,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 17:01:38,863 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 17:01:38,874 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/prod4br-ll_unwindbound20.c[524,537] [2022-07-13 17:01:38,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 17:01:38,899 INFO L208 MainTranslator]: Completed translation [2022-07-13 17:01:38,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38 WrapperNode [2022-07-13 17:01:38,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 17:01:38,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 17:01:38,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 17:01:38,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 17:01:38,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,943 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-07-13 17:01:38,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 17:01:38,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 17:01:38,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 17:01:38,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 17:01:38,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 17:01:38,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 17:01:38,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 17:01:38,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 17:01:38,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (1/1) ... [2022-07-13 17:01:38,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 17:01:38,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:38,985 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-13 17:01:38,991 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-13 17:01:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 17:01:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 17:01:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 17:01:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 17:01:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 17:01:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 17:01:39,058 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 17:01:39,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 17:01:39,146 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 17:01:39,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 17:01:39,150 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 17:01:39,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 05:01:39 BoogieIcfgContainer [2022-07-13 17:01:39,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 17:01:39,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 17:01:39,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 17:01:39,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 17:01:39,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 05:01:38" (1/3) ... [2022-07-13 17:01:39,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6c8cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 05:01:39, skipping insertion in model container [2022-07-13 17:01:39,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 05:01:38" (2/3) ... [2022-07-13 17:01:39,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6c8cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 05:01:39, skipping insertion in model container [2022-07-13 17:01:39,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 05:01:39" (3/3) ... [2022-07-13 17:01:39,183 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound20.c [2022-07-13 17:01:39,193 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 17:01:39,193 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 17:01:39,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 17:01:39,244 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@7d5f07b0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56a39539 [2022-07-13 17:01:39,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 17:01:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 17:01:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 17:01:39,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:39,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:39,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2022-07-13 17:01:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:39,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657609742] [2022-07-13 17:01:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:39,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657609742] [2022-07-13 17:01:39,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657609742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:01:39,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:01:39,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 17:01:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330587854] [2022-07-13 17:01:39,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:01:39,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 17:01:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 17:01:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 17:01:39,391 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 17:01:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:39,404 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-07-13 17:01:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 17:01:39,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 17:01:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:39,415 INFO L225 Difference]: With dead ends: 43 [2022-07-13 17:01:39,415 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 17:01:39,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-13 17:01:39,419 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:39,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:01:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 17:01:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 17:01:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-13 17:01:39,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2022-07-13 17:01:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:39,447 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-13 17:01:39,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 17:01:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-13 17:01:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 17:01:39,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:39,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:39,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 17:01:39,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2022-07-13 17:01:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:39,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691412869] [2022-07-13 17:01:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:39,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691412869] [2022-07-13 17:01:39,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691412869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:01:39,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:01:39,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 17:01:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707073941] [2022-07-13 17:01:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:01:39,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 17:01:39,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:39,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 17:01:39,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 17:01:39,539 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 17:01:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:39,557 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-07-13 17:01:39,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 17:01:39,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 17:01:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:39,589 INFO L225 Difference]: With dead ends: 29 [2022-07-13 17:01:39,589 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 17:01:39,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 17:01:39,595 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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-13 17:01:39,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:01:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 17:01:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 17:01:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-13 17:01:39,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2022-07-13 17:01:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:39,604 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 17:01:39,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 17:01:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-07-13 17:01:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 17:01:39,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:39,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:39,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 17:01:39,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2022-07-13 17:01:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:39,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930511292] [2022-07-13 17:01:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:39,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:39,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393694563] [2022-07-13 17:01:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:39,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:39,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:39,624 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-13 17:01:39,625 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-13 17:01:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:39,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 17:01:39,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:39,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:01:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930511292] [2022-07-13 17:01:39,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393694563] [2022-07-13 17:01:39,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393694563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:01:39,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:01:39,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 17:01:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394798092] [2022-07-13 17:01:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:01:39,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 17:01:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:39,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 17:01:39,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 17:01:39,784 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 17:01:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:39,830 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-07-13 17:01:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 17:01:39,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 17:01:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:39,831 INFO L225 Difference]: With dead ends: 34 [2022-07-13 17:01:39,831 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 17:01:39,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-13 17:01:39,832 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:39,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:01:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 17:01:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-07-13 17:01:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 17:01:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-13 17:01:39,837 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2022-07-13 17:01:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 17:01:39,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 17:01:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-13 17:01:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 17:01:39,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:39,839 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:39,862 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-13 17:01:40,054 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-13 17:01:40,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2022-07-13 17:01:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769907377] [2022-07-13 17:01:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:40,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955512454] [2022-07-13 17:01:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:40,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:40,071 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-13 17:01:40,072 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-13 17:01:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:40,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 17:01:40,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:40,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:01:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:40,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:40,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769907377] [2022-07-13 17:01:40,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:40,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955512454] [2022-07-13 17:01:40,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955512454] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:01:40,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 17:01:40,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-07-13 17:01:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524214118] [2022-07-13 17:01:40,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 17:01:40,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 17:01:40,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 17:01:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-13 17:01:40,535 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:40,838 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-13 17:01:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 17:01:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-13 17:01:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:40,840 INFO L225 Difference]: With dead ends: 47 [2022-07-13 17:01:40,840 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 17:01:40,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-07-13 17:01:40,841 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:40,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 83 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 17:01:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 17:01:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-07-13 17:01:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 17:01:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-13 17:01:40,847 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2022-07-13 17:01:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:40,847 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-13 17:01:40,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-13 17:01:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 17:01:40,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:40,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:40,864 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-13 17:01:41,063 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-13 17:01:41,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times [2022-07-13 17:01:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:41,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685493300] [2022-07-13 17:01:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:41,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:41,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094370355] [2022-07-13 17:01:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:41,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:41,077 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-13 17:01:41,078 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-13 17:01:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:41,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 17:01:41,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:41,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:01:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:41,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685493300] [2022-07-13 17:01:41,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:41,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094370355] [2022-07-13 17:01:41,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094370355] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:01:41,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 17:01:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-13 17:01:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938244284] [2022-07-13 17:01:41,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 17:01:41,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 17:01:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:41,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 17:01:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 17:01:41,155 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:41,214 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-07-13 17:01:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 17:01:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-07-13 17:01:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:41,215 INFO L225 Difference]: With dead ends: 95 [2022-07-13 17:01:41,215 INFO L226 Difference]: Without dead ends: 85 [2022-07-13 17:01:41,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 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-13 17:01:41,216 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:41,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:01:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-13 17:01:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-07-13 17:01:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 61 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 17:01:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2022-07-13 17:01:41,225 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 19 [2022-07-13 17:01:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:41,225 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2022-07-13 17:01:41,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-07-13 17:01:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 17:01:41,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:41,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:41,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 17:01:41,439 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-13 17:01:41,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1754945923, now seen corresponding path program 1 times [2022-07-13 17:01:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:41,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924870700] [2022-07-13 17:01:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:41,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:41,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760190454] [2022-07-13 17:01:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:41,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:41,464 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-13 17:01:41,465 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-13 17:01:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:41,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 17:01:41,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:42,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:01:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:43,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:43,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924870700] [2022-07-13 17:01:43,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:43,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760190454] [2022-07-13 17:01:43,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760190454] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:01:43,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 17:01:43,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-07-13 17:01:43,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877299601] [2022-07-13 17:01:43,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 17:01:43,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 17:01:43,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:43,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 17:01:43,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 17:01:43,186 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:44,710 INFO L93 Difference]: Finished difference Result 120 states and 157 transitions. [2022-07-13 17:01:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 17:01:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-07-13 17:01:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:44,711 INFO L225 Difference]: With dead ends: 120 [2022-07-13 17:01:44,711 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 17:01:44,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 17:01:44,712 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:44,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 80 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 17:01:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 17:01:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2022-07-13 17:01:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 17:01:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-07-13 17:01:44,722 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2022-07-13 17:01:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:44,722 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-07-13 17:01:44,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-07-13 17:01:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 17:01:44,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:44,723 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:44,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 17:01:44,940 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-13 17:01:44,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1942139802, now seen corresponding path program 1 times [2022-07-13 17:01:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:44,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992648252] [2022-07-13 17:01:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:44,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:44,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732961707] [2022-07-13 17:01:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:44,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:44,949 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-13 17:01:44,949 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-13 17:01:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:44,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 17:01:44,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 17:01:45,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:01:45,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992648252] [2022-07-13 17:01:45,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732961707] [2022-07-13 17:01:45,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732961707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:01:45,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:01:45,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 17:01:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089282719] [2022-07-13 17:01:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:01:45,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 17:01:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 17:01:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 17:01:45,017 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:45,118 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2022-07-13 17:01:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 17:01:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-07-13 17:01:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:45,119 INFO L225 Difference]: With dead ends: 108 [2022-07-13 17:01:45,119 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 17:01:45,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-13 17:01:45,120 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:45,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 83 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 17:01:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 17:01:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-07-13 17:01:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 17:01:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-13 17:01:45,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 21 [2022-07-13 17:01:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:45,130 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-13 17:01:45,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-13 17:01:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 17:01:45,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:45,132 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] [2022-07-13 17:01:45,148 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-13 17:01:45,339 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-13 17:01:45,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1954557947, now seen corresponding path program 1 times [2022-07-13 17:01:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:45,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136684577] [2022-07-13 17:01:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:45,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:45,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644906535] [2022-07-13 17:01:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:45,364 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-13 17:01:45,365 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-13 17:01:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:45,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 17:01:45,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 17:01:45,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 17:01:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136684577] [2022-07-13 17:01:45,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644906535] [2022-07-13 17:01:45,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644906535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 17:01:45,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 17:01:45,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 17:01:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887717057] [2022-07-13 17:01:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:01:45,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 17:01:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 17:01:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 17:01:45,427 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 17:01:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:45,492 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2022-07-13 17:01:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 17:01:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-07-13 17:01:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:45,493 INFO L225 Difference]: With dead ends: 133 [2022-07-13 17:01:45,493 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 17:01:45,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 17:01:45,494 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:45,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 17:01:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 17:01:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2022-07-13 17:01:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 84 states have internal predecessors, (107), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-13 17:01:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2022-07-13 17:01:45,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 32 [2022-07-13 17:01:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:45,506 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2022-07-13 17:01:45,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 17:01:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2022-07-13 17:01:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 17:01:45,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:45,507 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] [2022-07-13 17:01:45,529 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-13 17:01:45,729 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-13 17:01:45,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 346264643, now seen corresponding path program 1 times [2022-07-13 17:01:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:45,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030038200] [2022-07-13 17:01:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:45,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:45,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333590380] [2022-07-13 17:01:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:45,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:45,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:45,743 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-13 17:01:45,744 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-13 17:01:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 17:01:45,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 17:01:45,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 17:01:45,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:01:45,929 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-13 17:01:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030038200] [2022-07-13 17:01:45,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333590380] [2022-07-13 17:01:45,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333590380] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 17:01:45,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 17:01:45,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-07-13 17:01:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441116231] [2022-07-13 17:01:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 17:01:45,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 17:01:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 17:01:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 17:01:45,931 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:46,077 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-07-13 17:01:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 17:01:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-13 17:01:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:46,078 INFO L225 Difference]: With dead ends: 112 [2022-07-13 17:01:46,078 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 17:01:46,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-13 17:01:46,079 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:46,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 17:01:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 17:01:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 58. [2022-07-13 17:01:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 17:01:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-07-13 17:01:46,089 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 32 [2022-07-13 17:01:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:46,090 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-07-13 17:01:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 17:01:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-07-13 17:01:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 17:01:46,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:46,092 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:46,108 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-13 17:01:46,295 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-13 17:01:46,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 136508765, now seen corresponding path program 2 times [2022-07-13 17:01:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:46,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423124520] [2022-07-13 17:01:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:46,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281933503] [2022-07-13 17:01:46,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 17:01:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:46,304 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-13 17:01:46,305 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-13 17:01:46,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 17:01:46,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 17:01:46,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 17:01:46,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:46,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:01:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 17:01:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423124520] [2022-07-13 17:01:46,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281933503] [2022-07-13 17:01:46,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281933503] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:01:46,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 17:01:46,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-13 17:01:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45925982] [2022-07-13 17:01:46,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 17:01:46,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 17:01:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 17:01:46,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-13 17:01:46,495 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 17:01:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:46,609 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2022-07-13 17:01:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 17:01:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 46 [2022-07-13 17:01:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:46,610 INFO L225 Difference]: With dead ends: 132 [2022-07-13 17:01:46,610 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 17:01:46,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 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-13 17:01:46,611 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 129 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:46,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 196 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 17:01:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 17:01:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 17:01:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 17:01:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2022-07-13 17:01:46,625 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 46 [2022-07-13 17:01:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:46,625 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2022-07-13 17:01:46,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 17:01:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-07-13 17:01:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 17:01:46,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:46,627 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:46,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 17:01:46,843 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-13 17:01:46,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1689445411, now seen corresponding path program 3 times [2022-07-13 17:01:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:46,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636514748] [2022-07-13 17:01:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:46,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:46,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768126225] [2022-07-13 17:01:46,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 17:01:46,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:46,861 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-13 17:01:46,861 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-13 17:01:47,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 17:01:47,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 17:01:47,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 17:01:47,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 17:01:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 17:01:47,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 17:01:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 17:01:47,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 17:01:47,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636514748] [2022-07-13 17:01:47,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 17:01:47,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768126225] [2022-07-13 17:01:47,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768126225] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 17:01:47,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 17:01:47,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-13 17:01:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925029580] [2022-07-13 17:01:47,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 17:01:47,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 17:01:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 17:01:47,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 17:01:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-07-13 17:01:47,431 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-07-13 17:01:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 17:01:47,725 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2022-07-13 17:01:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 17:01:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 100 [2022-07-13 17:01:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 17:01:47,727 INFO L225 Difference]: With dead ends: 242 [2022-07-13 17:01:47,727 INFO L226 Difference]: Without dead ends: 234 [2022-07-13 17:01:47,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 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-13 17:01:47,728 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 440 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 17:01:47,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 302 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 17:01:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-13 17:01:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-07-13 17:01:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 191 states have internal predecessors, (252), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-13 17:01:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 295 transitions. [2022-07-13 17:01:47,742 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 295 transitions. Word has length 100 [2022-07-13 17:01:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 17:01:47,742 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 295 transitions. [2022-07-13 17:01:47,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-07-13 17:01:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 295 transitions. [2022-07-13 17:01:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 17:01:47,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 17:01:47,744 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:47,751 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-13 17:01:47,949 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-13 17:01:47,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 17:01:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 17:01:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1595985571, now seen corresponding path program 4 times [2022-07-13 17:01:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 17:01:47,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806222428] [2022-07-13 17:01:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 17:01:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 17:01:47,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 17:01:47,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675005475] [2022-07-13 17:01:47,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 17:01:47,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 17:01:47,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 17:01:47,961 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-13 17:01:47,964 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-13 17:01:48,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 17:01:48,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 17:01:48,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 17:01:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 17:01:48,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 17:01:48,365 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 17:01:48,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 17:01:48,386 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-13 17:01:48,579 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-13 17:01:48,582 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 17:01:48,584 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 17:01:48,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 05:01:48 BoogieIcfgContainer [2022-07-13 17:01:48,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 17:01:48,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 17:01:48,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 17:01:48,665 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 17:01:48,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 05:01:39" (3/4) ... [2022-07-13 17:01:48,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 17:01:48,730 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 17:01:48,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 17:01:48,731 INFO L158 Benchmark]: Toolchain (without parser) took 10047.73ms. Allocated memory was 96.5MB in the beginning and 161.5MB in the end (delta: 65.0MB). Free memory was 69.3MB in the beginning and 75.8MB in the end (delta: -6.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2022-07-13 17:01:48,731 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 61.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 17:01:48,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.17ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 69.2MB in the beginning and 109.0MB in the end (delta: -39.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 17:01:48,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.21ms. Allocated memory is still 134.2MB. Free memory was 108.8MB in the beginning and 107.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 17:01:48,731 INFO L158 Benchmark]: Boogie Preprocessor took 15.68ms. Allocated memory is still 134.2MB. Free memory was 107.1MB in the beginning and 106.2MB in the end (delta: 946.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 17:01:48,731 INFO L158 Benchmark]: RCFGBuilder took 191.26ms. Allocated memory is still 134.2MB. Free memory was 106.2MB in the beginning and 95.7MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 17:01:48,732 INFO L158 Benchmark]: TraceAbstraction took 9511.37ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 95.3MB in the beginning and 84.2MB in the end (delta: 11.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-07-13 17:01:48,732 INFO L158 Benchmark]: Witness Printer took 65.33ms. Allocated memory is still 161.5MB. Free memory was 84.2MB in the beginning and 75.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 17:01:48,733 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 96.5MB. Free memory was 61.1MB in the beginning and 61.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.17ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 69.2MB in the beginning and 109.0MB in the end (delta: -39.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.21ms. Allocated memory is still 134.2MB. Free memory was 108.8MB in the beginning and 107.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.68ms. Allocated memory is still 134.2MB. Free memory was 107.1MB in the beginning and 106.2MB in the end (delta: 946.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 191.26ms. Allocated memory is still 134.2MB. Free memory was 106.2MB in the beginning and 95.7MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9511.37ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 95.3MB in the beginning and 84.2MB in the end (delta: 11.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 65.33ms. Allocated memory is still 161.5MB. Free memory was 84.2MB in the beginning and 75.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [a=1048576, b=2097152, counter=0, p=1, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=1048576, b=2097152, counter=1, counter++=0, p=1, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1048576, b=2097152, counter=1, p=1, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1048576, b=2097152, counter=1, p=1, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=524288, b=1048576, counter=1, p=4, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=524288, b=1048576, counter=2, counter++=1, p=4, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=524288, b=1048576, counter=2, p=4, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=524288, b=1048576, counter=2, p=4, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=262144, b=524288, counter=2, p=16, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=262144, b=524288, counter=3, counter++=2, p=16, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=262144, b=524288, counter=3, p=16, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=262144, b=524288, counter=3, p=16, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=131072, b=262144, counter=3, p=64, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=131072, b=262144, counter=4, counter++=3, p=64, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=131072, b=262144, counter=4, p=64, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=131072, b=262144, counter=4, p=64, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=65536, b=131072, counter=4, p=256, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=65536, b=131072, counter=5, counter++=4, p=256, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=65536, b=131072, counter=5, p=256, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=65536, b=131072, counter=5, p=256, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32768, b=65536, counter=5, p=1024, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=32768, b=65536, counter=6, counter++=5, p=1024, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32768, b=65536, counter=6, p=1024, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32768, b=65536, counter=6, p=1024, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16384, b=32768, counter=6, p=4096, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=16384, b=32768, counter=7, counter++=6, p=4096, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16384, b=32768, counter=7, p=4096, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16384, b=32768, counter=7, p=4096, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8192, b=16384, counter=7, p=16384, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=8192, b=16384, counter=8, counter++=7, p=16384, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8192, b=16384, counter=8, p=16384, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8192, b=16384, counter=8, p=16384, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4096, b=8192, counter=8, p=65536, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=4096, b=8192, counter=9, counter++=8, p=65536, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4096, b=8192, counter=9, p=65536, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4096, b=8192, counter=9, p=65536, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2048, b=4096, counter=9, p=262144, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=2048, b=4096, counter=10, counter++=9, p=262144, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2048, b=4096, counter=10, p=262144, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2048, b=4096, counter=10, p=262144, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1024, b=2048, counter=10, p=1048576, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=1024, b=2048, counter=11, counter++=10, p=1048576, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1024, b=2048, counter=11, p=1048576, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1024, b=2048, counter=11, p=1048576, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=512, b=1024, counter=11, p=4194304, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=512, b=1024, counter=12, counter++=11, p=4194304, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=512, b=1024, counter=12, p=4194304, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=512, b=1024, counter=12, p=4194304, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=256, b=512, counter=12, p=16777216, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=256, b=512, counter=13, counter++=12, p=16777216, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=256, b=512, counter=13, p=16777216, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=256, b=512, counter=13, p=16777216, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=128, b=256, counter=13, p=67108864, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=128, b=256, counter=14, counter++=13, p=67108864, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=128, b=256, counter=14, p=67108864, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=128, b=256, counter=14, p=67108864, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=64, b=128, counter=14, p=268435456, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=64, b=128, counter=15, counter++=14, p=268435456, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=64, b=128, counter=15, p=268435456, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=64, b=128, counter=15, p=268435456, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32, b=64, counter=15, p=1073741824, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=32, b=64, counter=16, counter++=15, p=1073741824, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32, b=64, counter=16, p=1073741824, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32, b=64, counter=16, p=1073741824, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16, b=32, counter=16, p=4294967296, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=16, b=32, counter=17, counter++=16, p=4294967296, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16, b=32, counter=17, p=4294967296, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16, b=32, counter=17, p=4294967296, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8, b=16, counter=17, p=17179869184, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=8, b=16, counter=18, counter++=17, p=17179869184, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8, b=16, counter=18, p=17179869184, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8, b=16, counter=18, p=17179869184, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4, b=8, counter=18, p=68719476736, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=4, b=8, counter=19, counter++=18, p=68719476736, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4, b=8, counter=19, p=68719476736, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4, b=8, counter=19, p=68719476736, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2, b=4, counter=19, p=274877906944, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=2, b=4, counter=20, counter++=19, p=274877906944, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2, b=4, counter=20, p=274877906944, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2, b=4, counter=20, p=274877906944, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1, b=2, counter=20, p=1099511627776, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=1, b=2, counter=21, counter++=20, p=1099511627776, q=0, x=1048576, y=2097152] [L33] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 1186 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 280 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=11, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 124 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 529 ConstructedInterpolants, 0 QuantifiedInterpolants, 1895 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 340/1126 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-13 17:01:48,756 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