./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN --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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:31:01,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:31:01,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:31:01,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:31:01,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:31:01,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:31:01,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:31:01,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:31:01,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:31:01,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:31:01,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:31:01,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:31:01,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:31:01,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:31:01,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:31:01,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:31:01,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:31:01,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:31:01,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:31:01,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:31:01,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:31:01,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:31:01,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:31:01,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:31:01,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:31:01,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:31:01,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:31:01,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:31:01,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:31:01,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:31:01,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:31:01,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:31:01,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:31:01,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:31:01,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:31:01,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:31:01,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:31:01,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:31:01,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:31:01,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:31:01,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:31:01,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:31:01,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:31:01,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:31:01,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:31:01,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:31:01,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:31:01,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:31:01,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:31:01,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:31:01,913 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:31:01,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:31:01,914 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:31:01,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:31:01,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:31:01,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:31:01,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:31:01,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:31:01,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:31:01,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:31:01,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:31:01,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:31:01,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:31:01,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:31:01,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:31:01,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:31:01,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:01,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:31:01,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:31:01,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:31:01,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:31:01,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:31:01,918 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:31:01,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:31:01,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:31:01,919 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2022-11-20 10:31:02,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:31:02,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:31:02,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:31:02,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:31:02,290 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:31:02,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-11-20 10:31:05,407 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:31:05,666 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:31:05,667 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-11-20 10:31:05,675 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/data/d2f33e1e1/dac37d63b0fe41b29cd7684368221970/FLAGd70ff604c [2022-11-20 10:31:05,694 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/data/d2f33e1e1/dac37d63b0fe41b29cd7684368221970 [2022-11-20 10:31:05,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:31:05,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:31:05,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:05,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:31:05,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:31:05,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:05" (1/1) ... [2022-11-20 10:31:05,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5945193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:05, skipping insertion in model container [2022-11-20 10:31:05,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:05" (1/1) ... [2022-11-20 10:31:05,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:31:05,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:31:05,944 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-11-20 10:31:05,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:05,962 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:31:05,987 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-11-20 10:31:05,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:06,004 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:31:06,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06 WrapperNode [2022-11-20 10:31:06,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:06,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:06,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:31:06,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:31:06,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,036 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-20 10:31:06,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:06,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:31:06,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:31:06,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:31:06,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,068 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:31:06,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:31:06,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:31:06,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:31:06,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (1/1) ... [2022-11-20 10:31:06,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:06,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:31:06,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:31:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:31:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:31:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-11-20 10:31:06,177 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-11-20 10:31:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-11-20 10:31:06,177 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-11-20 10:31:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:31:06,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:31:06,239 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:31:06,241 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:31:06,392 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:31:06,399 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:31:06,409 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:31:06,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:06 BoogieIcfgContainer [2022-11-20 10:31:06,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:31:06,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:31:06,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:31:06,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:31:06,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:31:05" (1/3) ... [2022-11-20 10:31:06,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdbd30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:31:06, skipping insertion in model container [2022-11-20 10:31:06,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:06" (2/3) ... [2022-11-20 10:31:06,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdbd30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:31:06, skipping insertion in model container [2022-11-20 10:31:06,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:06" (3/3) ... [2022-11-20 10:31:06,425 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-11-20 10:31:06,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:31:06,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:31:06,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:31:06,532 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@554246b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:31:06,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:31:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:31:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:31:06,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:06,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:06,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-11-20 10:31:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:06,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275860536] [2022-11-20 10:31:06,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275860536] [2022-11-20 10:31:06,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275860536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:06,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:06,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009324431] [2022-11-20 10:31:06,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:06,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:06,999 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:31:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:07,059 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-11-20 10:31:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-20 10:31:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:07,070 INFO L225 Difference]: With dead ends: 43 [2022-11-20 10:31:07,070 INFO L226 Difference]: Without dead ends: 27 [2022-11-20 10:31:07,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:07,077 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:07,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:31:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-20 10:31:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-20 10:31:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-20 10:31:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-20 10:31:07,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-11-20 10:31:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:07,122 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-20 10:31:07,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:31:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-20 10:31:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:31:07,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:07,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:07,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:31:07,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-11-20 10:31:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515535348] [2022-11-20 10:31:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:07,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515535348] [2022-11-20 10:31:07,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515535348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:07,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:07,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773220995] [2022-11-20 10:31:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:07,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:07,288 INFO L87 Difference]: Start difference. First operand 27 states and 34 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:31:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:07,320 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-20 10:31:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:07,321 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-20 10:31:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:07,322 INFO L225 Difference]: With dead ends: 33 [2022-11-20 10:31:07,322 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 10:31:07,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:07,324 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:07,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:31:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 10:31:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-20 10:31:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-20 10:31:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-20 10:31:07,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-11-20 10:31:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:07,339 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-20 10:31:07,339 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:31:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-20 10:31:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:31:07,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:07,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:07,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:31:07,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-11-20 10:31:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:07,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936410183] [2022-11-20 10:31:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:31:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:07,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936410183] [2022-11-20 10:31:07,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936410183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:07,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851047414] [2022-11-20 10:31:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:07,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:07,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:07,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:31:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:31:07,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:07,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:08,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851047414] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:08,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:08,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-11-20 10:31:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543667956] [2022-11-20 10:31:08,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:08,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:31:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:31:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:31:08,095 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 10:31:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:08,364 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-11-20 10:31:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:31:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-11-20 10:31:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:08,366 INFO L225 Difference]: With dead ends: 55 [2022-11-20 10:31:08,367 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 10:31:08,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:31:08,369 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:08,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:31:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 10:31:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-20 10:31:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-20 10:31:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-20 10:31:08,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-11-20 10:31:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:08,378 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-20 10:31:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 10:31:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-20 10:31:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:31:08,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:08,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:08,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:08,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:08,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-11-20 10:31:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:08,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055605165] [2022-11-20 10:31:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055605165] [2022-11-20 10:31:08,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055605165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221115461] [2022-11-20 10:31:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:08,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:08,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:08,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:31:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:31:08,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:08,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:09,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221115461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:09,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:09,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-11-20 10:31:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712648437] [2022-11-20 10:31:09,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:09,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:31:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:31:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:31:09,184 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:31:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:09,409 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-11-20 10:31:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:31:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-11-20 10:31:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:09,418 INFO L225 Difference]: With dead ends: 51 [2022-11-20 10:31:09,419 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 10:31:09,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:31:09,423 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:09,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 92 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:31:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 10:31:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-11-20 10:31:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-11-20 10:31:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-11-20 10:31:09,454 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-11-20 10:31:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:09,456 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-11-20 10:31:09,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:31:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-11-20 10:31:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:31:09,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:09,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:09,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:09,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:09,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-11-20 10:31:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:09,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693027124] [2022-11-20 10:31:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 10:31:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:31:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:31:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693027124] [2022-11-20 10:31:09,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693027124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111457248] [2022-11-20 10:31:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:09,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:09,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:31:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:09,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:09,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111457248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:10,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:10,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-11-20 10:31:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696554885] [2022-11-20 10:31:10,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:10,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:31:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:31:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:31:10,394 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-20 10:31:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:10,704 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-11-20 10:31:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:31:10,705 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-11-20 10:31:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:10,706 INFO L225 Difference]: With dead ends: 105 [2022-11-20 10:31:10,707 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:31:10,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:31:10,708 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:10,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 95 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:31:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:31:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 10:31:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-11-20 10:31:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-11-20 10:31:10,719 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-11-20 10:31:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:10,719 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-11-20 10:31:10,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-20 10:31:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-11-20 10:31:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:31:10,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:10,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:10,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:10,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:10,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-11-20 10:31:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177820276] [2022-11-20 10:31:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:31:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:11,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177820276] [2022-11-20 10:31:11,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177820276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961959166] [2022-11-20 10:31:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:11,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:11,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:31:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:11,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:31:11,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:11,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961959166] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:11,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:11,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-11-20 10:31:11,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690801253] [2022-11-20 10:31:11,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:11,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:31:11,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:11,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:31:11,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:31:11,649 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-20 10:31:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:12,160 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-11-20 10:31:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:31:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2022-11-20 10:31:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:12,163 INFO L225 Difference]: With dead ends: 177 [2022-11-20 10:31:12,164 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 10:31:12,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-11-20 10:31:12,166 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:12,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 10:31:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-11-20 10:31:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-11-20 10:31:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-11-20 10:31:12,187 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-11-20 10:31:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:12,187 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-11-20 10:31:12,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-20 10:31:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-11-20 10:31:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:31:12,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:12,193 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:12,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 10:31:12,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:12,398 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-11-20 10:31:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:12,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286503523] [2022-11-20 10:31:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 10:31:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 10:31:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:12,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286503523] [2022-11-20 10:31:12,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286503523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:12,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996593523] [2022-11-20 10:31:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:12,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:12,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:12,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:12,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:31:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:31:12,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 10:31:12,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:31:13,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996593523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:13,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:13,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-11-20 10:31:13,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686343003] [2022-11-20 10:31:13,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:13,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:31:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:13,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:31:13,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:31:13,577 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 10:31:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:14,207 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-11-20 10:31:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:31:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2022-11-20 10:31:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:14,219 INFO L225 Difference]: With dead ends: 255 [2022-11-20 10:31:14,219 INFO L226 Difference]: Without dead ends: 155 [2022-11-20 10:31:14,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-11-20 10:31:14,222 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:14,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 227 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-20 10:31:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-11-20 10:31:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2022-11-20 10:31:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-11-20 10:31:14,268 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-11-20 10:31:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:14,268 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-11-20 10:31:14,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 10:31:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-11-20 10:31:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 10:31:14,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:14,279 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:14,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:14,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:14,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-11-20 10:31:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:14,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751858730] [2022-11-20 10:31:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:31:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-20 10:31:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:14,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751858730] [2022-11-20 10:31:14,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751858730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:14,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670204573] [2022-11-20 10:31:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:14,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:14,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:31:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:31:14,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-20 10:31:15,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-20 10:31:16,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670204573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:16,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-11-20 10:31:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436184401] [2022-11-20 10:31:16,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:31:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:31:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:31:16,102 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-11-20 10:31:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:16,743 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-11-20 10:31:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 10:31:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2022-11-20 10:31:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:16,745 INFO L225 Difference]: With dead ends: 240 [2022-11-20 10:31:16,745 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 10:31:16,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 194 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 10:31:16,748 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:16,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 209 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 10:31:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-11-20 10:31:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2022-11-20 10:31:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-20 10:31:16,780 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-11-20 10:31:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:16,781 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-20 10:31:16,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-11-20 10:31:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-20 10:31:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-20 10:31:16,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:16,789 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:16,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:16,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:31:16,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-11-20 10:31:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:16,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626396985] [2022-11-20 10:31:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:31:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 10:31:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-11-20 10:31:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626396985] [2022-11-20 10:31:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626396985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:17,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663456178] [2022-11-20 10:31:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:17,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:17,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:31:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:31:17,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-11-20 10:31:17,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-20 10:31:19,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663456178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:19,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:19,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-11-20 10:31:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503786561] [2022-11-20 10:31:19,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:19,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 10:31:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 10:31:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-11-20 10:31:19,419 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-11-20 10:31:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:20,087 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-11-20 10:31:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:31:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2022-11-20 10:31:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:20,108 INFO L225 Difference]: With dead ends: 214 [2022-11-20 10:31:20,108 INFO L226 Difference]: Without dead ends: 134 [2022-11-20 10:31:20,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 320 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 10:31:20,110 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:20,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 235 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-20 10:31:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-11-20 10:31:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2022-11-20 10:31:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-11-20 10:31:20,149 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-11-20 10:31:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,150 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-11-20 10:31:20,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-11-20 10:31:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-11-20 10:31:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-20 10:31:20,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,158 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:20,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:20,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 10:31:20,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-11-20 10:31:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282455476] [2022-11-20 10:31:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 10:31:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2022-11-20 10:31:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:21,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282455476] [2022-11-20 10:31:21,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282455476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:21,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320264513] [2022-11-20 10:31:21,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:21,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:21,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:21,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:31:21,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:21,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:21,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:31:21,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-11-20 10:31:21,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-11-20 10:31:24,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320264513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:24,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:24,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2022-11-20 10:31:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096796596] [2022-11-20 10:31:24,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:31:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:31:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-11-20 10:31:24,136 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2022-11-20 10:31:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:24,948 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-11-20 10:31:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 10:31:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 271 [2022-11-20 10:31:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:24,951 INFO L225 Difference]: With dead ends: 260 [2022-11-20 10:31:24,951 INFO L226 Difference]: Without dead ends: 155 [2022-11-20 10:31:24,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 599 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 10:31:24,954 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:24,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:31:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-20 10:31:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-11-20 10:31:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2022-11-20 10:31:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-11-20 10:31:24,971 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-11-20 10:31:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:24,972 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-11-20 10:31:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2022-11-20 10:31:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-11-20 10:31:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-11-20 10:31:24,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:24,980 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 27, 27, 25, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 12, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:24,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:25,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:31:25,186 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2022-11-20 10:31:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267669236] [2022-11-20 10:31:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:31:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-20 10:31:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-20 10:31:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 264 proven. 626 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2022-11-20 10:31:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267669236] [2022-11-20 10:31:26,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267669236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675010570] [2022-11-20 10:31:26,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:31:26,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:26,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:26,992 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:27,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:31:27,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:31:27,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:27,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:31:27,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2022-11-20 10:31:27,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2022-11-20 10:31:28,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675010570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:28,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:28,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2022-11-20 10:31:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514261434] [2022-11-20 10:31:28,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:28,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 10:31:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 10:31:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:31:28,262 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-20 10:31:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:28,514 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2022-11-20 10:31:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:31:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 394 [2022-11-20 10:31:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:28,517 INFO L225 Difference]: With dead ends: 283 [2022-11-20 10:31:28,517 INFO L226 Difference]: Without dead ends: 147 [2022-11-20 10:31:28,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 895 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:31:28,519 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:28,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 161 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:31:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-20 10:31:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-11-20 10:31:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.198019801980198) internal successors, (121), 98 states have internal predecessors, (121), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (66), 26 states have call predecessors, (66), 26 states have call successors, (66) [2022-11-20 10:31:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2022-11-20 10:31:28,535 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2022-11-20 10:31:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:28,535 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2022-11-20 10:31:28,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-20 10:31:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2022-11-20 10:31:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2022-11-20 10:31:28,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:28,548 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:28,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:28,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:31:28,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2022-11-20 10:31:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:28,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373656291] [2022-11-20 10:31:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-20 10:31:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-11-20 10:31:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1090 proven. 942 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2022-11-20 10:31:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:31,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373656291] [2022-11-20 10:31:31,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373656291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:31,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395807721] [2022-11-20 10:31:31,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:31:31,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:31,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:31,727 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:31,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:31:31,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:31:31,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:31,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 10:31:32,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 490 proven. 1080 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2022-11-20 10:31:32,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 492 proven. 1108 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2022-11-20 10:31:35,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395807721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:35,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:35,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2022-11-20 10:31:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699081423] [2022-11-20 10:31:35,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:35,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 10:31:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 10:31:35,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 10:31:35,935 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2022-11-20 10:31:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:37,341 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2022-11-20 10:31:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 10:31:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) Word has length 542 [2022-11-20 10:31:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:37,346 INFO L225 Difference]: With dead ends: 355 [2022-11-20 10:31:37,346 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 10:31:37,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1215 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2022-11-20 10:31:37,350 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 175 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:37,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 464 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:31:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 10:31:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2022-11-20 10:31:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.091743119266055) internal successors, (119), 106 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 16 states have return successors, (42), 26 states have call predecessors, (42), 29 states have call successors, (42) [2022-11-20 10:31:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2022-11-20 10:31:37,369 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2022-11-20 10:31:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:37,371 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2022-11-20 10:31:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2022-11-20 10:31:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2022-11-20 10:31:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-11-20 10:31:37,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:37,376 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:37,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:37,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:37,583 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2022-11-20 10:31:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:37,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883848209] [2022-11-20 10:31:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 10:31:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:31:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:31:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:31:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:31:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2022-11-20 10:31:39,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:39,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883848209] [2022-11-20 10:31:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883848209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:39,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388490789] [2022-11-20 10:31:39,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:31:39,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:39,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:39,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:39,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:31:39,954 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-20 10:31:39,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:39,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:31:39,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2022-11-20 10:31:40,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 920 proven. 137 refuted. 0 times theorem prover too weak. 4312 trivial. 0 not checked. [2022-11-20 10:31:42,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388490789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:42,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:42,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2022-11-20 10:31:42,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779817310] [2022-11-20 10:31:42,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:42,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 10:31:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 10:31:42,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2022-11-20 10:31:42,159 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2022-11-20 10:31:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:43,131 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2022-11-20 10:31:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 10:31:43,132 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) Word has length 433 [2022-11-20 10:31:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:43,135 INFO L225 Difference]: With dead ends: 333 [2022-11-20 10:31:43,136 INFO L226 Difference]: Without dead ends: 185 [2022-11-20 10:31:43,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 972 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2022-11-20 10:31:43,138 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:43,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 584 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:31:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-20 10:31:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2022-11-20 10:31:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 110 states have internal predecessors, (118), 30 states have call successors, (30), 23 states have call predecessors, (30), 16 states have return successors, (41), 25 states have call predecessors, (41), 30 states have call successors, (41) [2022-11-20 10:31:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2022-11-20 10:31:43,156 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2022-11-20 10:31:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:43,157 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2022-11-20 10:31:43,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2022-11-20 10:31:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2022-11-20 10:31:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-11-20 10:31:43,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:43,163 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:43,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:43,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:43,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2022-11-20 10:31:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:43,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468879256] [2022-11-20 10:31:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:43,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:43,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:43,685 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:31:43,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:31:43,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:31:43,692 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:43,700 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:31:43,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:31:43 BoogieIcfgContainer [2022-11-20 10:31:43,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:31:43,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:31:43,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:31:43,835 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:31:43,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:06" (3/4) ... [2022-11-20 10:31:43,838 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:31:43,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:31:43,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:31:43,919 INFO L158 Benchmark]: Toolchain (without parser) took 38216.86ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 143.8MB in the beginning and 365.3MB in the end (delta: -221.5MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2022-11-20 10:31:43,919 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:31:43,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.38ms. Allocated memory is still 172.0MB. Free memory was 143.3MB in the beginning and 133.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:31:43,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.86ms. Allocated memory is still 172.0MB. Free memory was 133.3MB in the beginning and 131.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:31:43,920 INFO L158 Benchmark]: Boogie Preprocessor took 33.49ms. Allocated memory is still 172.0MB. Free memory was 131.7MB in the beginning and 130.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:31:43,920 INFO L158 Benchmark]: RCFGBuilder took 340.35ms. Allocated memory is still 172.0MB. Free memory was 130.6MB in the beginning and 120.2MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:31:43,921 INFO L158 Benchmark]: TraceAbstraction took 37419.93ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 119.7MB in the beginning and 376.9MB in the end (delta: -257.1MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2022-11-20 10:31:43,921 INFO L158 Benchmark]: Witness Printer took 83.50ms. Allocated memory is still 522.2MB. Free memory was 376.9MB in the beginning and 365.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:31:43,923 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.30ms. Allocated memory is still 125.8MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.38ms. Allocated memory is still 172.0MB. Free memory was 143.3MB in the beginning and 133.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.86ms. Allocated memory is still 172.0MB. Free memory was 133.3MB in the beginning and 131.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.49ms. Allocated memory is still 172.0MB. Free memory was 131.7MB in the beginning and 130.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 340.35ms. Allocated memory is still 172.0MB. Free memory was 130.6MB in the beginning and 120.2MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37419.93ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 119.7MB in the beginning and 376.9MB in the end (delta: -257.1MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 83.50ms. Allocated memory is still 522.2MB. Free memory was 376.9MB in the beginning and 365.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.2s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1050 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 977 mSDsluCounter, 2916 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2514 mSDsCounter, 1248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6175 IncrementalHoareTripleChecker+Invalid, 7423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1248 mSolverCounterUnsat, 402 mSDtfsCounter, 6175 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4557 SyntacticMatches, 52 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=13, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4111 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6142 ConstructedInterpolants, 0 QuantifiedInterpolants, 9059 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 56580/63747 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-11-20 10:31:43,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0095d1a0-eb12-4d0c-9a86-368f80586b55/bin/uautomizer-ug76WZFUDN/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