./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/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_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 17:08:16,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:08:16,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:08:16,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:08:16,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:08:16,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:08:16,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:08:16,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:08:16,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:08:16,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:08:16,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:08:16,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:08:16,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:08:17,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:08:17,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:08:17,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:08:17,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:08:17,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:08:17,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:08:17,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:08:17,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:08:17,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:08:17,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:08:17,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:08:17,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:08:17,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:08:17,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:08:17,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:08:17,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:08:17,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:08:17,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:08:17,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:08:17,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:08:17,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:08:17,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:08:17,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:08:17,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:08:17,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:08:17,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:08:17,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:08:17,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:08:17,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:08:17,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:08:17,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:08:17,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:08:17,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:08:17,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:08:17,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:08:17,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:08:17,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:08:17,076 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:08:17,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:08:17,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:08:17,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:08:17,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:08:17,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:08:17,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:08:17,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:08:17,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:08:17,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:08:17,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:08:17,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:08:17,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:08:17,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:08:17,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:08:17,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:08:17,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:08:17,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:08:17,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:08:17,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:08:17,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:08:17,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:08:17,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:08:17,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:08:17,083 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:08:17,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:08:17,083 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/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_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R 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-25 17:08:17,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:08:17,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:08:17,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:08:17,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:08:17,431 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:08:17,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-11-25 17:08:20,624 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:08:20,891 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:08:20,893 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-11-25 17:08:20,907 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/data/88d129d4c/5b30e8de66ce4a8081619f5f8196a345/FLAGbe946516f [2022-11-25 17:08:20,930 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/data/88d129d4c/5b30e8de66ce4a8081619f5f8196a345 [2022-11-25 17:08:20,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:08:20,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:08:20,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:08:20,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:08:20,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:08:20,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:08:20" (1/1) ... [2022-11-25 17:08:20,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e37f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:20, skipping insertion in model container [2022-11-25 17:08:20,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:08:20" (1/1) ... [2022-11-25 17:08:20,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:08:20,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:08:21,174 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_5a0f2656-13e0-4041-b54a-060b0330f97e/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-11-25 17:08:21,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:08:21,192 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:08:21,217 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_5a0f2656-13e0-4041-b54a-060b0330f97e/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-11-25 17:08:21,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:08:21,232 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:08:21,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21 WrapperNode [2022-11-25 17:08:21,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:08:21,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:08:21,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:08:21,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:08:21,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,264 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-11-25 17:08:21,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:08:21,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:08:21,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:08:21,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:08:21,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,284 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:08:21,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:08:21,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:08:21,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:08:21,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (1/1) ... [2022-11-25 17:08:21,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:08:21,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:21,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:08:21,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:08:21,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:08:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:08:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-11-25 17:08:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-11-25 17:08:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-11-25 17:08:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-11-25 17:08:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:08:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:08:21,461 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:08:21,463 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:08:21,580 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:08:21,587 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:08:21,587 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:08:21,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:08:21 BoogieIcfgContainer [2022-11-25 17:08:21,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:08:21,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:08:21,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:08:21,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:08:21,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:08:20" (1/3) ... [2022-11-25 17:08:21,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502bffb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:08:21, skipping insertion in model container [2022-11-25 17:08:21,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:21" (2/3) ... [2022-11-25 17:08:21,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502bffb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:08:21, skipping insertion in model container [2022-11-25 17:08:21,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:08:21" (3/3) ... [2022-11-25 17:08:21,601 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-11-25 17:08:21,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:08:21,627 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:08:21,714 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:08:21,724 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;@280c35e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:08:21,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:08:21,730 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-25 17:08:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 17:08:21,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:21,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:21,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:21,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-11-25 17:08:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426379537] [2022-11-25 17:08:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,126 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-25 17:08:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426379537] [2022-11-25 17:08:22,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426379537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:22,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:22,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796327091] [2022-11-25 17:08:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:22,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:22,241 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-25 17:08:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:22,351 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-11-25 17:08:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:22,356 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-25 17:08:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:22,365 INFO L225 Difference]: With dead ends: 43 [2022-11-25 17:08:22,365 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 17:08:22,368 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-25 17:08:22,374 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:22,376 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.1s Time] [2022-11-25 17:08:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 17:08:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 17:08:22,426 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-25 17:08:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-25 17:08:22,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-11-25 17:08:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:22,432 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-25 17:08:22,433 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-25 17:08:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-25 17:08:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:08:22,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:22,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:22,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:08:22,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-11-25 17:08:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:22,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539544273] [2022-11-25 17:08:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,636 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-25 17:08:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:22,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539544273] [2022-11-25 17:08:22,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539544273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:22,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:22,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600252575] [2022-11-25 17:08:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:22,642 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-25 17:08:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:22,713 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-25 17:08:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:22,714 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-25 17:08:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:22,718 INFO L225 Difference]: With dead ends: 33 [2022-11-25 17:08:22,719 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 17:08:22,723 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-25 17:08:22,725 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:22,725 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.1s Time] [2022-11-25 17:08:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 17:08:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-25 17:08:22,732 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-25 17:08:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-25 17:08:22,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-11-25 17:08:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:22,737 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-25 17:08:22,741 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-25 17:08:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-25 17:08:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:08:22,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:22,746 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-25 17:08:22,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:08:22,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:22,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-11-25 17:08:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:22,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28446082] [2022-11-25 17:08:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:22,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:08:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:22,959 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-25 17:08:22,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28446082] [2022-11-25 17:08:22,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28446082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:22,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069381383] [2022-11-25 17:08:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:22,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:22,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:22,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:22,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:08:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:23,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:08:23,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:23,248 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-25 17:08:23,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:23,573 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-25 17:08:23,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069381383] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:23,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:23,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-11-25 17:08:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776043002] [2022-11-25 17:08:23,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:23,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:08:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:08:23,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:08:23,577 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-25 17:08:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:23,852 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-11-25 17:08:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:08:23,853 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-25 17:08:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:23,854 INFO L225 Difference]: With dead ends: 55 [2022-11-25 17:08:23,854 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 17:08:23,855 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-25 17:08:23,856 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 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-25 17:08:23,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:08:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 17:08:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-25 17:08:23,862 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-25 17:08:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-11-25 17:08:23,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-11-25 17:08:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:23,864 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-11-25 17:08:23,865 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-25 17:08:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-11-25 17:08:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:08:23,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:23,867 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-25 17:08:23,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:24,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-11-25 17:08:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:24,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646319475] [2022-11-25 17:08:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:24,400 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-25 17:08:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:24,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646319475] [2022-11-25 17:08:24,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646319475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:24,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872997124] [2022-11-25 17:08:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:24,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:24,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:08:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:24,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:08:24,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:24,574 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-25 17:08:24,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:24,799 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-25 17:08:24,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872997124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:24,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:24,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-11-25 17:08:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983421213] [2022-11-25 17:08:24,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:24,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:08:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:08:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:08:24,804 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-25 17:08:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:25,032 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-11-25 17:08:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:08:25,033 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-25 17:08:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:25,038 INFO L225 Difference]: With dead ends: 51 [2022-11-25 17:08:25,038 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 17:08:25,039 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-25 17:08:25,040 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:25,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:08:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 17:08:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-11-25 17:08:25,065 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-25 17:08:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-11-25 17:08:25,068 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-11-25 17:08:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:25,069 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-11-25 17:08:25,069 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-25 17:08:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-11-25 17:08:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:08:25,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:25,084 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-25 17:08:25,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:25,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:25,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-11-25 17:08:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622616240] [2022-11-25 17:08:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 17:08:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:08:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,540 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-25 17:08:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:25,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622616240] [2022-11-25 17:08:25,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622616240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:25,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635679391] [2022-11-25 17:08:25,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:25,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:25,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:25,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:25,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:08:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:25,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:08:25,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:25,777 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-25 17:08:25,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:26,215 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-25 17:08:26,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635679391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:26,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:26,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-11-25 17:08:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412432235] [2022-11-25 17:08:26,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:26,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 17:08:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 17:08:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:08:26,224 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-25 17:08:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:26,543 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-11-25 17:08:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:08:26,544 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-25 17:08:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:26,546 INFO L225 Difference]: With dead ends: 105 [2022-11-25 17:08:26,546 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 17:08:26,547 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-25 17:08:26,548 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:26,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 95 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:08:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 17:08:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 17:08:26,561 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-25 17:08:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-11-25 17:08:26,563 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-11-25 17:08:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:26,563 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-11-25 17:08:26,564 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-25 17:08:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-11-25 17:08:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:08:26,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:26,565 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-25 17:08:26,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:26,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:26,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-11-25 17:08:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:26,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144107014] [2022-11-25 17:08:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:26,974 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-25 17:08:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:26,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144107014] [2022-11-25 17:08:26,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144107014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526291990] [2022-11-25 17:08:26,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:26,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:26,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:26,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:08:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:27,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:08:27,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:27,159 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-25 17:08:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:27,576 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-25 17:08:27,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526291990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:27,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:27,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-11-25 17:08:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159385947] [2022-11-25 17:08:27,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:08:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:08:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:08:27,581 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-25 17:08:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:28,127 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-11-25 17:08:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:08:28,128 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-25 17:08:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:28,132 INFO L225 Difference]: With dead ends: 177 [2022-11-25 17:08:28,133 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 17:08:28,142 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-25 17:08:28,147 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:28,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:08:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 17:08:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-11-25 17:08:28,185 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-25 17:08:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-11-25 17:08:28,193 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-11-25 17:08:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:28,195 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-11-25 17:08:28,196 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-25 17:08:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-11-25 17:08:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 17:08:28,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:28,201 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-25 17:08:28,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:28,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 17:08:28,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-11-25 17:08:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680106480] [2022-11-25 17:08:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 17:08:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,660 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-25 17:08:28,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680106480] [2022-11-25 17:08:28,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680106480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701379451] [2022-11-25 17:08:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:28,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:28,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:28,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:08:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:28,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:08:28,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:28,895 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-25 17:08:28,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:29,575 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-25 17:08:29,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701379451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:29,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:29,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-11-25 17:08:29,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121114711] [2022-11-25 17:08:29,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:29,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:08:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:08:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:08:29,581 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-25 17:08:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:30,206 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-11-25 17:08:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 17:08:30,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-25 17:08:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:30,211 INFO L225 Difference]: With dead ends: 255 [2022-11-25 17:08:30,211 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 17:08:30,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-11-25 17:08:30,214 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:30,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:08:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 17:08:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-11-25 17:08:30,238 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-25 17:08:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-11-25 17:08:30,241 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-11-25 17:08:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:30,241 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-11-25 17:08:30,242 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-25 17:08:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-11-25 17:08:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 17:08:30,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:30,245 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-25 17:08:30,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:30,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:30,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-11-25 17:08:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:30,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082986249] [2022-11-25 17:08:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:08:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,914 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-25 17:08:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:30,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082986249] [2022-11-25 17:08:30,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082986249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:30,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286933404] [2022-11-25 17:08:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:30,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:30,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:30,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:08:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:31,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:08:31,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:31,223 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-25 17:08:31,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:32,317 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-25 17:08:32,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286933404] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:32,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:32,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-11-25 17:08:32,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10895109] [2022-11-25 17:08:32,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:32,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 17:08:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 17:08:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-11-25 17:08:32,322 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-25 17:08:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:32,989 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-11-25 17:08:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 17:08:32,990 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-25 17:08:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:32,993 INFO L225 Difference]: With dead ends: 240 [2022-11-25 17:08:32,993 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 17:08:32,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 194 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 17:08:32,999 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:32,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 209 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:08:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 17:08:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-11-25 17:08:33,036 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-25 17:08:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-25 17:08:33,038 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-11-25 17:08:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:33,039 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-25 17:08:33,040 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-25 17:08:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-25 17:08:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-25 17:08:33,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:33,050 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-25 17:08:33,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 17:08:33,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:33,256 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-11-25 17:08:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749895708] [2022-11-25 17:08:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 17:08:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 17:08:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,044 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-25 17:08:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749895708] [2022-11-25 17:08:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749895708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100470636] [2022-11-25 17:08:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:34,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:34,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:34,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:08:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:34,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:08:34,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:34,372 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-25 17:08:34,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:36,026 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-25 17:08:36,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100470636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:36,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:36,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-11-25 17:08:36,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092582356] [2022-11-25 17:08:36,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:36,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 17:08:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 17:08:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:08:36,029 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-25 17:08:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:36,796 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-11-25 17:08:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:08:36,797 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-25 17:08:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:36,806 INFO L225 Difference]: With dead ends: 214 [2022-11-25 17:08:36,807 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 17:08:36,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 320 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 17:08:36,812 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 71 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:36,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 235 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:08:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 17:08:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-11-25 17:08:36,852 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-25 17:08:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-11-25 17:08:36,856 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-11-25 17:08:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:36,857 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-11-25 17:08:36,858 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-25 17:08:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-11-25 17:08:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-25 17:08:36,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:36,866 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-25 17:08:36,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:37,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:37,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-11-25 17:08:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:37,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076280298] [2022-11-25 17:08:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:37,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:08:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 17:08:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:08:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,412 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-25 17:08:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:38,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076280298] [2022-11-25 17:08:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076280298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:38,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803582786] [2022-11-25 17:08:38,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:08:38,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:38,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:38,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:08:38,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:08:38,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:08:38,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 17:08:38,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:38,818 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-25 17:08:38,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:41,181 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-25 17:08:41,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803582786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:41,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:41,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2022-11-25 17:08:41,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914681455] [2022-11-25 17:08:41,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:41,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 17:08:41,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 17:08:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-11-25 17:08:41,186 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-25 17:08:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:42,060 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-11-25 17:08:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 17:08:42,062 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-25 17:08:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:42,065 INFO L225 Difference]: With dead ends: 260 [2022-11-25 17:08:42,065 INFO L226 Difference]: Without dead ends: 155 [2022-11-25 17:08:42,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 599 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 17:08:42,067 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 66 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:42,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 270 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:08:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-25 17:08:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-11-25 17:08:42,086 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-25 17:08:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-11-25 17:08:42,088 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-11-25 17:08:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:42,089 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-11-25 17:08:42,089 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-25 17:08:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-11-25 17:08:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-11-25 17:08:42,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:42,098 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-25 17:08:42,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:42,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:08:42,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2022-11-25 17:08:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:42,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704827664] [2022-11-25 17:08:42,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:08:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-25 17:08:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-25 17:08:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 17:08:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:44,405 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-25 17:08:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:44,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704827664] [2022-11-25 17:08:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704827664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:44,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846960069] [2022-11-25 17:08:44,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:08:44,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:44,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:44,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:44,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:08:44,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 17:08:44,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:08:44,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:08:44,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:44,660 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-25 17:08:44,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:45,849 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-25 17:08:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846960069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:45,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:45,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2022-11-25 17:08:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087932645] [2022-11-25 17:08:45,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:45,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:08:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:08:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:08:45,854 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-25 17:08:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:46,103 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2022-11-25 17:08:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:08:46,104 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-25 17:08:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:46,106 INFO L225 Difference]: With dead ends: 283 [2022-11-25 17:08:46,106 INFO L226 Difference]: Without dead ends: 147 [2022-11-25 17:08:46,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 895 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:08:46,109 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:46,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 161 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:08:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-25 17:08:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-11-25 17:08:46,122 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-25 17:08:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2022-11-25 17:08:46,125 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2022-11-25 17:08:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:46,125 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2022-11-25 17:08:46,126 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-25 17:08:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2022-11-25 17:08:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2022-11-25 17:08:46,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:46,140 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-25 17:08:46,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 17:08:46,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2022-11-25 17:08:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:46,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933067488] [2022-11-25 17:08:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 17:08:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-25 17:08:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 17:08:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-11-25 17:08:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,483 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-25 17:08:49,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:49,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933067488] [2022-11-25 17:08:49,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933067488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:49,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952131379] [2022-11-25 17:08:49,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:08:49,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:49,487 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:49,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:08:49,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:08:49,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:08:49,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:08:49,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:50,122 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-25 17:08:50,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:54,240 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-25 17:08:54,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952131379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:54,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:54,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2022-11-25 17:08:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652634438] [2022-11-25 17:08:54,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 17:08:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 17:08:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 17:08:54,245 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-25 17:08:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:55,901 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2022-11-25 17:08:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 17:08:55,903 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-25 17:08:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:55,906 INFO L225 Difference]: With dead ends: 355 [2022-11-25 17:08:55,906 INFO L226 Difference]: Without dead ends: 183 [2022-11-25 17:08:55,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1215 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2022-11-25 17:08:55,910 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:55,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 537 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 17:08:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-25 17:08:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2022-11-25 17:08:55,924 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-25 17:08:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2022-11-25 17:08:55,926 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2022-11-25 17:08:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:55,927 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2022-11-25 17:08:55,928 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-25 17:08:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2022-11-25 17:08:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-11-25 17:08:55,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:55,938 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-25 17:08:55,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:56,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:56,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2022-11-25 17:08:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323165013] [2022-11-25 17:08:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 17:08:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-25 17:08:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-25 17:08:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:08:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 17:08:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 17:08:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:08:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 17:08:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,356 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-25 17:08:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323165013] [2022-11-25 17:08:58,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323165013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694734258] [2022-11-25 17:08:58,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:08:58,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:58,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:58,359 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:58,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:08:58,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-25 17:08:58,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:08:58,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:08:58,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:58,931 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-25 17:08:58,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:01,133 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-25 17:09:01,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694734258] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:01,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:09:01,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2022-11-25 17:09:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397908319] [2022-11-25 17:09:01,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:01,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 17:09:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 17:09:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 17:09:01,138 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-25 17:09:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:02,164 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2022-11-25 17:09:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 17:09:02,165 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-25 17:09:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:02,171 INFO L225 Difference]: With dead ends: 333 [2022-11-25 17:09:02,171 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 17:09:02,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 972 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2022-11-25 17:09:02,175 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 91 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:02,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 584 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:09:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 17:09:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2022-11-25 17:09:02,197 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-25 17:09:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2022-11-25 17:09:02,199 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2022-11-25 17:09:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:02,203 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2022-11-25 17:09:02,204 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-25 17:09:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2022-11-25 17:09:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-11-25 17:09:02,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:02,210 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-25 17:09:02,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:02,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:02,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2022-11-25 17:09:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:02,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541768968] [2022-11-25 17:09:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:02,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:09:02,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:09:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:09:02,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:09:02,735 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:09:02,737 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:09:02,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:09:02,746 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:02,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:09:02,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:09:02 BoogieIcfgContainer [2022-11-25 17:09:02,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:09:02,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:09:02,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:09:02,927 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:09:02,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:08:21" (3/4) ... [2022-11-25 17:09:02,930 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:09:03,043 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:09:03,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:09:03,044 INFO L158 Benchmark]: Toolchain (without parser) took 42106.36ms. Allocated memory was 172.0MB in the beginning and 536.9MB in the end (delta: 364.9MB). Free memory was 142.1MB in the beginning and 408.9MB in the end (delta: -266.8MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2022-11-25 17:09:03,044 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:09:03,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.76ms. Allocated memory is still 172.0MB. Free memory was 142.1MB in the beginning and 131.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:09:03,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.02ms. Allocated memory is still 172.0MB. Free memory was 131.8MB in the beginning and 130.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:09:03,046 INFO L158 Benchmark]: Boogie Preprocessor took 21.27ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 129.3MB in the end (delta: 969.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:09:03,046 INFO L158 Benchmark]: RCFGBuilder took 302.89ms. Allocated memory is still 172.0MB. Free memory was 129.3MB in the beginning and 119.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:09:03,047 INFO L158 Benchmark]: TraceAbstraction took 41333.34ms. Allocated memory was 172.0MB in the beginning and 536.9MB in the end (delta: 364.9MB). Free memory was 118.6MB in the beginning and 419.4MB in the end (delta: -300.8MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2022-11-25 17:09:03,047 INFO L158 Benchmark]: Witness Printer took 116.65ms. Allocated memory is still 536.9MB. Free memory was 419.4MB in the beginning and 408.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:09:03,049 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.28ms. Allocated memory is still 121.6MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.76ms. Allocated memory is still 172.0MB. Free memory was 142.1MB in the beginning and 131.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.02ms. Allocated memory is still 172.0MB. Free memory was 131.8MB in the beginning and 130.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.27ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 129.3MB in the end (delta: 969.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 302.89ms. Allocated memory is still 172.0MB. Free memory was 129.3MB in the beginning and 119.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41333.34ms. Allocated memory was 172.0MB in the beginning and 536.9MB in the end (delta: 364.9MB). Free memory was 118.6MB in the beginning and 419.4MB in the end (delta: -300.8MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 116.65ms. Allocated memory is still 536.9MB. Free memory was 419.4MB in the beginning and 408.9MB in the end (delta: 10.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: 41.1s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 752 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 2989 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 999 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6400 IncrementalHoareTripleChecker+Invalid, 7399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 999 mSolverCounterUnsat, 410 mSDtfsCounter, 6400 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4557 SyntacticMatches, 52 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4065 ImplicationChecksByTransitivity, 5.3s 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.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 27.9s 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-25 17:09:03,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a0f2656-13e0-4041-b54a-060b0330f97e/bin/uautomizer-ZsLfNo2U6R/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