./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8 --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- 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-2329fc7 [2022-12-13 17:18:24,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:18:24,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:18:24,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:18:24,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:18:24,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:18:24,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:18:24,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:18:24,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:18:24,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:18:24,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:18:24,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:18:24,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:18:24,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:18:24,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:18:24,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:18:24,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:18:24,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:18:24,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:18:24,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:18:24,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:18:24,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:18:24,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:18:24,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:18:24,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:18:24,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:18:24,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:18:24,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:18:24,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:18:24,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:18:24,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:18:24,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:18:24,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:18:24,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:18:24,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:18:24,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:18:24,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:18:24,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:18:24,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:18:24,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:18:24,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:18:24,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:18:24,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:18:24,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:18:24,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:18:24,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:18:24,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:18:24,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:18:24,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:18:24,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:18:24,450 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:18:24,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:18:24,450 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:18:24,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:18:24,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:18:24,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:18:24,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:18:24,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:18:24,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:18:24,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:18:24,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:18:24,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:18:24,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:18:24,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:18:24,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:18:24,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:18:24,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:18:24,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:18:24,453 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:18:24,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:18:24,454 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:18:24,461 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_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/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_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2022-12-13 17:18:24,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:18:24,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:18:24,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:18:24,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:18:24,691 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:18:24,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loop-invgen/heapsort.i [2022-12-13 17:18:27,214 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:18:27,370 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:18:27,370 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/sv-benchmarks/c/loop-invgen/heapsort.i [2022-12-13 17:18:27,376 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/data/f422eed18/2ddfbf006c1b431a8e1be020f92a8db2/FLAG0f2ca6793 [2022-12-13 17:18:27,791 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/data/f422eed18/2ddfbf006c1b431a8e1be020f92a8db2 [2022-12-13 17:18:27,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:18:27,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:18:27,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:18:27,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:18:27,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:18:27,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:18:27" (1/1) ... [2022-12-13 17:18:27,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c193c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:27, skipping insertion in model container [2022-12-13 17:18:27,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:18:27" (1/1) ... [2022-12-13 17:18:27,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:18:27,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:18:27,956 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_fdd79218-b085-4071-a9d7-1cf3150fb48e/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-12-13 17:18:27,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:18:27,982 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:18:27,994 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_fdd79218-b085-4071-a9d7-1cf3150fb48e/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-12-13 17:18:28,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:18:28,013 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:18:28,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28 WrapperNode [2022-12-13 17:18:28,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:18:28,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:18:28,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:18:28,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:18:28,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,038 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-12-13 17:18:28,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:18:28,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:18:28,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:18:28,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:18:28,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,056 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:18:28,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:18:28,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:18:28,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:18:28,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (1/1) ... [2022-12-13 17:18:28,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:18:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:18:28,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:18:28,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:18:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:18:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:18:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:18:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:18:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 17:18:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 17:18:28,186 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:18:28,187 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:18:28,297 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:18:28,303 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:18:28,303 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 17:18:28,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:18:28 BoogieIcfgContainer [2022-12-13 17:18:28,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:18:28,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:18:28,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:18:28,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:18:28,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:18:27" (1/3) ... [2022-12-13 17:18:28,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3842750d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:18:28, skipping insertion in model container [2022-12-13 17:18:28,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:18:28" (2/3) ... [2022-12-13 17:18:28,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3842750d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:18:28, skipping insertion in model container [2022-12-13 17:18:28,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:18:28" (3/3) ... [2022-12-13 17:18:28,311 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-12-13 17:18:28,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:18:28,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:18:28,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:18:28,369 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;@49944269, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:18:28,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:18:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 17:18:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 17:18:28,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:28,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:28,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1754201352, now seen corresponding path program 1 times [2022-12-13 17:18:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:28,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565483740] [2022-12-13 17:18:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:28,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565483740] [2022-12-13 17:18:28,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565483740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:28,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:28,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:18:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799563207] [2022-12-13 17:18:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:28,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:18:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:28,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:18:28,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:18:28,632 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:28,730 INFO L93 Difference]: Finished difference Result 104 states and 193 transitions. [2022-12-13 17:18:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:18:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 17:18:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:28,738 INFO L225 Difference]: With dead ends: 104 [2022-12-13 17:18:28,738 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 17:18:28,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:28,743 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:28,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:18:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 17:18:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-12-13 17:18:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 17:18:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2022-12-13 17:18:28,774 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2022-12-13 17:18:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:28,774 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-12-13 17:18:28,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-12-13 17:18:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 17:18:28,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:28,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:28,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:18:28,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1749464583, now seen corresponding path program 1 times [2022-12-13 17:18:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:28,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266255505] [2022-12-13 17:18:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:28,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266255505] [2022-12-13 17:18:28,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266255505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:28,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:28,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:18:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476126230] [2022-12-13 17:18:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:28,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:18:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:18:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:18:28,873 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:28,949 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-12-13 17:18:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:18:28,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 17:18:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:28,951 INFO L225 Difference]: With dead ends: 46 [2022-12-13 17:18:28,951 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 17:18:28,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:28,954 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:28,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:18:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 17:18:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-12-13 17:18:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 17:18:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-12-13 17:18:28,967 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2022-12-13 17:18:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:28,967 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-12-13 17:18:28,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-12-13 17:18:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 17:18:28,968 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:28,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:28,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:18:28,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1728015063, now seen corresponding path program 1 times [2022-12-13 17:18:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:28,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878515053] [2022-12-13 17:18:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:29,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:29,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878515053] [2022-12-13 17:18:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878515053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:18:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254539030] [2022-12-13 17:18:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:29,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:18:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:18:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:29,072 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:29,197 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-12-13 17:18:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:29,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 17:18:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:29,198 INFO L225 Difference]: With dead ends: 76 [2022-12-13 17:18:29,199 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 17:18:29,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:18:29,200 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:29,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 17:18:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2022-12-13 17:18:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-13 17:18:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2022-12-13 17:18:29,214 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 11 [2022-12-13 17:18:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:29,214 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2022-12-13 17:18:29,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2022-12-13 17:18:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:18:29,215 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:29,216 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:29,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:18:29,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1885075524, now seen corresponding path program 1 times [2022-12-13 17:18:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:29,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126738692] [2022-12-13 17:18:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:29,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126738692] [2022-12-13 17:18:29,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126738692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:29,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:29,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:18:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418577101] [2022-12-13 17:18:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:29,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:18:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:29,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:18:29,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:29,337 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:29,508 INFO L93 Difference]: Finished difference Result 102 states and 153 transitions. [2022-12-13 17:18:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 17:18:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:29,510 INFO L225 Difference]: With dead ends: 102 [2022-12-13 17:18:29,510 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 17:18:29,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:18:29,512 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:29,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 217 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 17:18:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-12-13 17:18:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-12-13 17:18:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2022-12-13 17:18:29,533 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 16 [2022-12-13 17:18:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:29,533 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2022-12-13 17:18:29,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2022-12-13 17:18:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:18:29,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:29,534 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:29,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:18:29,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:29,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1503713061, now seen corresponding path program 1 times [2022-12-13 17:18:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:29,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083271507] [2022-12-13 17:18:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083271507] [2022-12-13 17:18:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083271507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:29,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:29,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:18:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711709524] [2022-12-13 17:18:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:18:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:18:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:18:29,586 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:29,657 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2022-12-13 17:18:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:18:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 17:18:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:29,660 INFO L225 Difference]: With dead ends: 103 [2022-12-13 17:18:29,660 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 17:18:29,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:29,661 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:29,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:18:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 17:18:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-13 17:18:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-12-13 17:18:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2022-12-13 17:18:29,677 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 16 [2022-12-13 17:18:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:29,677 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2022-12-13 17:18:29,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2022-12-13 17:18:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:18:29,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:29,678 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:29,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:18:29,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1518715221, now seen corresponding path program 1 times [2022-12-13 17:18:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:29,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443517260] [2022-12-13 17:18:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:29,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443517260] [2022-12-13 17:18:29,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443517260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:29,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:29,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:18:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853094744] [2022-12-13 17:18:29,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:29,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:18:29,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:29,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:18:29,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:29,750 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:29,948 INFO L93 Difference]: Finished difference Result 155 states and 240 transitions. [2022-12-13 17:18:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:29,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 17:18:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:29,950 INFO L225 Difference]: With dead ends: 155 [2022-12-13 17:18:29,950 INFO L226 Difference]: Without dead ends: 153 [2022-12-13 17:18:29,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:18:29,952 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:29,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 245 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-13 17:18:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2022-12-13 17:18:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 72 states have internal predecessors, (94), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2022-12-13 17:18:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2022-12-13 17:18:29,988 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 16 [2022-12-13 17:18:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:29,989 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2022-12-13 17:18:29,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2022-12-13 17:18:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:18:29,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:29,990 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:29,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:18:29,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1823085758, now seen corresponding path program 1 times [2022-12-13 17:18:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:29,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253115037] [2022-12-13 17:18:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:30,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253115037] [2022-12-13 17:18:30,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253115037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:30,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:30,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:18:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998961028] [2022-12-13 17:18:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:30,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:18:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:18:30,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:18:30,010 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:30,047 INFO L93 Difference]: Finished difference Result 274 states and 436 transitions. [2022-12-13 17:18:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:18:30,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 17:18:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:30,049 INFO L225 Difference]: With dead ends: 274 [2022-12-13 17:18:30,049 INFO L226 Difference]: Without dead ends: 205 [2022-12-13 17:18:30,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:18:30,051 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:30,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:18:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-13 17:18:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-12-13 17:18:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 99 states have (on average 1.404040404040404) internal successors, (139), 103 states have internal predecessors, (139), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2022-12-13 17:18:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-12-13 17:18:30,091 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 16 [2022-12-13 17:18:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:30,091 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-12-13 17:18:30,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-12-13 17:18:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:18:30,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:30,093 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:30,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:18:30,093 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2105521235, now seen corresponding path program 1 times [2022-12-13 17:18:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:30,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621971873] [2022-12-13 17:18:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:18:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:30,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621971873] [2022-12-13 17:18:30,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621971873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:30,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:30,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:18:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216338085] [2022-12-13 17:18:30,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:30,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:18:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:18:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:18:30,134 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:30,213 INFO L93 Difference]: Finished difference Result 230 states and 359 transitions. [2022-12-13 17:18:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:18:30,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 17:18:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:30,215 INFO L225 Difference]: With dead ends: 230 [2022-12-13 17:18:30,215 INFO L226 Difference]: Without dead ends: 183 [2022-12-13 17:18:30,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:30,216 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:30,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:18:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-12-13 17:18:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-12-13 17:18:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-12-13 17:18:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2022-12-13 17:18:30,251 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 16 [2022-12-13 17:18:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:30,251 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2022-12-13 17:18:30,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 17:18:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2022-12-13 17:18:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 17:18:30,252 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:30,252 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:30,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:18:30,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash 186914675, now seen corresponding path program 1 times [2022-12-13 17:18:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:30,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553327424] [2022-12-13 17:18:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:18:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:30,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553327424] [2022-12-13 17:18:30,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553327424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:30,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:30,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:18:30,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430687536] [2022-12-13 17:18:30,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:30,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:18:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:18:30,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:30,312 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:18:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:30,426 INFO L93 Difference]: Finished difference Result 217 states and 348 transitions. [2022-12-13 17:18:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:30,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-12-13 17:18:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:30,428 INFO L225 Difference]: With dead ends: 217 [2022-12-13 17:18:30,428 INFO L226 Difference]: Without dead ends: 215 [2022-12-13 17:18:30,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:18:30,429 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:30,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-12-13 17:18:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2022-12-13 17:18:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 102 states have internal predecessors, (133), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2022-12-13 17:18:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2022-12-13 17:18:30,464 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 23 [2022-12-13 17:18:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:30,465 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2022-12-13 17:18:30,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:18:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2022-12-13 17:18:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 17:18:30,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:30,466 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:30,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:18:30,466 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:30,466 INFO L85 PathProgramCache]: Analyzing trace with hash 768784003, now seen corresponding path program 1 times [2022-12-13 17:18:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:30,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047590239] [2022-12-13 17:18:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:18:30,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:30,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047590239] [2022-12-13 17:18:30,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047590239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:30,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:30,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:18:30,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066899283] [2022-12-13 17:18:30,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:30,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:18:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:30,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:18:30,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:18:30,528 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:18:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:30,762 INFO L93 Difference]: Finished difference Result 520 states and 854 transitions. [2022-12-13 17:18:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:18:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-13 17:18:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:30,766 INFO L225 Difference]: With dead ends: 520 [2022-12-13 17:18:30,766 INFO L226 Difference]: Without dead ends: 366 [2022-12-13 17:18:30,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:30,767 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:30,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 136 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:18:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-13 17:18:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 197. [2022-12-13 17:18:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 102 states have internal predecessors, (131), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2022-12-13 17:18:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 315 transitions. [2022-12-13 17:18:30,809 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 315 transitions. Word has length 25 [2022-12-13 17:18:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:30,811 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 315 transitions. [2022-12-13 17:18:30,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:18:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 315 transitions. [2022-12-13 17:18:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 17:18:30,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:30,813 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:30,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:18:30,813 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -299150037, now seen corresponding path program 1 times [2022-12-13 17:18:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:30,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796258502] [2022-12-13 17:18:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 17:18:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:18:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:30,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796258502] [2022-12-13 17:18:30,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796258502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:30,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:30,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:18:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212568356] [2022-12-13 17:18:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:30,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:18:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:18:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:18:30,866 INFO L87 Difference]: Start difference. First operand 197 states and 315 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 17:18:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:31,019 INFO L93 Difference]: Finished difference Result 291 states and 471 transitions. [2022-12-13 17:18:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:18:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-12-13 17:18:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:31,021 INFO L225 Difference]: With dead ends: 291 [2022-12-13 17:18:31,021 INFO L226 Difference]: Without dead ends: 289 [2022-12-13 17:18:31,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:18:31,021 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:31,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-12-13 17:18:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2022-12-13 17:18:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 132 states have internal predecessors, (161), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2022-12-13 17:18:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 441 transitions. [2022-12-13 17:18:31,051 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 441 transitions. Word has length 26 [2022-12-13 17:18:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:31,051 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 441 transitions. [2022-12-13 17:18:31,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 17:18:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 441 transitions. [2022-12-13 17:18:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 17:18:31,052 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:31,052 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:31,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:18:31,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:31,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1714235681, now seen corresponding path program 1 times [2022-12-13 17:18:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:31,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849564305] [2022-12-13 17:18:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 17:18:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:18:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849564305] [2022-12-13 17:18:31,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849564305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:31,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:31,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:18:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434483995] [2022-12-13 17:18:31,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:31,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:18:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:31,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:18:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:31,144 INFO L87 Difference]: Start difference. First operand 269 states and 441 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 17:18:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:31,307 INFO L93 Difference]: Finished difference Result 317 states and 516 transitions. [2022-12-13 17:18:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-12-13 17:18:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:31,310 INFO L225 Difference]: With dead ends: 317 [2022-12-13 17:18:31,310 INFO L226 Difference]: Without dead ends: 315 [2022-12-13 17:18:31,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:18:31,311 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:31,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 197 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-12-13 17:18:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2022-12-13 17:18:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 125 states have (on average 1.36) internal successors, (170), 141 states have internal predecessors, (170), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-12-13 17:18:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 470 transitions. [2022-12-13 17:18:31,350 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 470 transitions. Word has length 28 [2022-12-13 17:18:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:31,351 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 470 transitions. [2022-12-13 17:18:31,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 17:18:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 470 transitions. [2022-12-13 17:18:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 17:18:31,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:31,352 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:18:31,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 523331784, now seen corresponding path program 1 times [2022-12-13 17:18:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:31,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426514097] [2022-12-13 17:18:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 17:18:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:18:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 17:18:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 17:18:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426514097] [2022-12-13 17:18:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426514097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:31,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:31,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:18:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265931019] [2022-12-13 17:18:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:31,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:18:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:18:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:31,434 INFO L87 Difference]: Start difference. First operand 287 states and 470 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:18:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:31,622 INFO L93 Difference]: Finished difference Result 329 states and 527 transitions. [2022-12-13 17:18:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:31,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-12-13 17:18:31,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:31,624 INFO L225 Difference]: With dead ends: 329 [2022-12-13 17:18:31,624 INFO L226 Difference]: Without dead ends: 327 [2022-12-13 17:18:31,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:18:31,625 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:31,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 194 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-12-13 17:18:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2022-12-13 17:18:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 128 states have (on average 1.3515625) internal successors, (173), 144 states have internal predecessors, (173), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-12-13 17:18:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2022-12-13 17:18:31,664 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 38 [2022-12-13 17:18:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:31,664 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2022-12-13 17:18:31,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:18:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2022-12-13 17:18:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 17:18:31,665 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:31,665 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:31,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:18:31,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:31,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1856149802, now seen corresponding path program 1 times [2022-12-13 17:18:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:31,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536255797] [2022-12-13 17:18:31,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:18:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 17:18:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 17:18:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:31,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536255797] [2022-12-13 17:18:31,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536255797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:31,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:31,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:18:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917884205] [2022-12-13 17:18:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:31,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:18:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:18:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:31,720 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:18:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:31,860 INFO L93 Difference]: Finished difference Result 297 states and 478 transitions. [2022-12-13 17:18:31,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:18:31,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-12-13 17:18:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:31,861 INFO L225 Difference]: With dead ends: 297 [2022-12-13 17:18:31,861 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 17:18:31,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:18:31,862 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:31,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 17:18:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-12-13 17:18:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 147 states have internal predecessors, (176), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-12-13 17:18:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 476 transitions. [2022-12-13 17:18:31,899 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 476 transitions. Word has length 38 [2022-12-13 17:18:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:31,900 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 476 transitions. [2022-12-13 17:18:31,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:18:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 476 transitions. [2022-12-13 17:18:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 17:18:31,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:31,900 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:31,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:18:31,901 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2019762676, now seen corresponding path program 1 times [2022-12-13 17:18:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:31,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150631940] [2022-12-13 17:18:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:18:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 17:18:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:18:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:18:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 17:18:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:31,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150631940] [2022-12-13 17:18:31,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150631940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:31,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:18:31,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:18:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846040005] [2022-12-13 17:18:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:31,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:18:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:18:31,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:18:31,965 INFO L87 Difference]: Start difference. First operand 295 states and 476 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:18:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:32,107 INFO L93 Difference]: Finished difference Result 329 states and 525 transitions. [2022-12-13 17:18:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:18:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2022-12-13 17:18:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:32,109 INFO L225 Difference]: With dead ends: 329 [2022-12-13 17:18:32,109 INFO L226 Difference]: Without dead ends: 327 [2022-12-13 17:18:32,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:18:32,110 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:32,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 226 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-12-13 17:18:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 174. [2022-12-13 17:18:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2022-12-13 17:18:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2022-12-13 17:18:32,138 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 50 [2022-12-13 17:18:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:32,138 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2022-12-13 17:18:32,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:18:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2022-12-13 17:18:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 17:18:32,139 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:32,139 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:32,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:18:32,140 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2077570128, now seen corresponding path program 1 times [2022-12-13 17:18:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:32,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454006977] [2022-12-13 17:18:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 17:18:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 17:18:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 17:18:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:18:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:18:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:18:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-13 17:18:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454006977] [2022-12-13 17:18:32,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454006977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:18:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783839627] [2022-12-13 17:18:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:18:32,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:18:32,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:18:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:18:32,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:18:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 17:18:32,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:18:32,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783839627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:18:32,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:18:32,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-12-13 17:18:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227885322] [2022-12-13 17:18:32,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:18:32,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:18:32,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:18:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:18:32,348 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 17:18:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:32,558 INFO L93 Difference]: Finished difference Result 505 states and 801 transitions. [2022-12-13 17:18:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:18:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2022-12-13 17:18:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:32,560 INFO L225 Difference]: With dead ends: 505 [2022-12-13 17:18:32,560 INFO L226 Difference]: Without dead ends: 335 [2022-12-13 17:18:32,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:18:32,561 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:32,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 168 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:18:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-12-13 17:18:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2022-12-13 17:18:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 152 states have internal predecessors, (183), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2022-12-13 17:18:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2022-12-13 17:18:32,608 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 58 [2022-12-13 17:18:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:32,609 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2022-12-13 17:18:32,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 17:18:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2022-12-13 17:18:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 17:18:32,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:32,610 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-13 17:18:32,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:18:32,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:32,811 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1244619342, now seen corresponding path program 1 times [2022-12-13 17:18:32,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:32,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853847669] [2022-12-13 17:18:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 17:18:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:18:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 17:18:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:18:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:18:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 17:18:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 17:18:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:18:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:18:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 17:18:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-12-13 17:18:32,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:32,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853847669] [2022-12-13 17:18:32,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853847669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:18:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409676953] [2022-12-13 17:18:32,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:32,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:32,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:18:32,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:18:32,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:18:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:32,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:18:32,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:18:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-12-13 17:18:33,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:18:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-12-13 17:18:33,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409676953] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:18:33,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:18:33,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-12-13 17:18:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278685114] [2022-12-13 17:18:33,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:18:33,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 17:18:33,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:33,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 17:18:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:18:33,156 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-12-13 17:18:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:34,400 INFO L93 Difference]: Finished difference Result 671 states and 1116 transitions. [2022-12-13 17:18:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 17:18:34,400 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 80 [2022-12-13 17:18:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:34,403 INFO L225 Difference]: With dead ends: 671 [2022-12-13 17:18:34,403 INFO L226 Difference]: Without dead ends: 669 [2022-12-13 17:18:34,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 17:18:34,404 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 275 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:34,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 624 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:18:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-12-13 17:18:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 367. [2022-12-13 17:18:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 181 states have internal predecessors, (220), 188 states have call successors, (188), 15 states have call predecessors, (188), 15 states have return successors, (188), 170 states have call predecessors, (188), 188 states have call successors, (188) [2022-12-13 17:18:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 596 transitions. [2022-12-13 17:18:34,480 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 596 transitions. Word has length 80 [2022-12-13 17:18:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:34,480 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 596 transitions. [2022-12-13 17:18:34,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-12-13 17:18:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 596 transitions. [2022-12-13 17:18:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 17:18:34,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:34,482 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:34,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:18:34,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 17:18:34,683 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1679445438, now seen corresponding path program 2 times [2022-12-13 17:18:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:34,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000236934] [2022-12-13 17:18:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 17:18:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 17:18:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 17:18:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:18:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:18:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 17:18:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 17:18:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:18:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:18:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 17:18:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 17:18:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-12-13 17:18:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:34,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000236934] [2022-12-13 17:18:34,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000236934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:18:34,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325777758] [2022-12-13 17:18:34,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:18:34,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:34,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:18:34,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:18:34,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:18:34,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:18:34,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:18:34,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:18:34,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:18:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-12-13 17:18:35,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:18:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-12-13 17:18:35,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325777758] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:18:35,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:18:35,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-13 17:18:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109159750] [2022-12-13 17:18:35,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:18:35,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 17:18:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:35,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 17:18:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:18:35,160 INFO L87 Difference]: Start difference. First operand 367 states and 596 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2022-12-13 17:18:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:35,519 INFO L93 Difference]: Finished difference Result 399 states and 639 transitions. [2022-12-13 17:18:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 17:18:35,519 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 85 [2022-12-13 17:18:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:35,521 INFO L225 Difference]: With dead ends: 399 [2022-12-13 17:18:35,521 INFO L226 Difference]: Without dead ends: 317 [2022-12-13 17:18:35,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:18:35,522 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 98 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:35,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 148 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:18:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-12-13 17:18:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2022-12-13 17:18:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 154 states have internal predecessors, (184), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-12-13 17:18:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 472 transitions. [2022-12-13 17:18:35,588 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 472 transitions. Word has length 85 [2022-12-13 17:18:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:35,588 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 472 transitions. [2022-12-13 17:18:35,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2022-12-13 17:18:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 472 transitions. [2022-12-13 17:18:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 17:18:35,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:18:35,590 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:18:35,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:18:35,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 17:18:35,791 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:18:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:18:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 520521549, now seen corresponding path program 1 times [2022-12-13 17:18:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:18:35,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303864833] [2022-12-13 17:18:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:18:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:18:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:18:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:18:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 17:18:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:18:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:18:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:18:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:18:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:18:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:18:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 17:18:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 17:18:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:18:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 17:18:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:18:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:18:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 17:18:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:18:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 17:18:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 17:18:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-12-13 17:18:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:18:35,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303864833] [2022-12-13 17:18:35,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303864833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:18:35,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725925219] [2022-12-13 17:18:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:18:35,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:35,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:18:35,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:18:35,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:18:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:18:36,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:18:36,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:18:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-12-13 17:18:36,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:18:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-12-13 17:18:36,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725925219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:18:36,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:18:36,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-13 17:18:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101965640] [2022-12-13 17:18:36,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:18:36,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 17:18:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:18:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 17:18:36,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:18:36,358 INFO L87 Difference]: Start difference. First operand 301 states and 472 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2022-12-13 17:18:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:18:39,110 INFO L93 Difference]: Finished difference Result 894 states and 1429 transitions. [2022-12-13 17:18:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 17:18:39,111 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) Word has length 129 [2022-12-13 17:18:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:18:39,111 INFO L225 Difference]: With dead ends: 894 [2022-12-13 17:18:39,111 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 17:18:39,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1180, Invalid=4370, Unknown=0, NotChecked=0, Total=5550 [2022-12-13 17:18:39,116 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 349 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:18:39,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 845 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 17:18:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 17:18:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 17:18:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:18:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 17:18:39,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2022-12-13 17:18:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:18:39,117 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 17:18:39,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2022-12-13 17:18:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 17:18:39,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 17:18:39,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 17:18:39,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 17:18:39,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:18:39,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 17:19:16,675 WARN L233 SmtUtils]: Spent 35.20s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:19:48,634 WARN L233 SmtUtils]: Spent 31.96s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:20:22,391 WARN L233 SmtUtils]: Spent 33.06s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:20:54,324 WARN L233 SmtUtils]: Spent 31.84s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:25:23,652 WARN L233 SmtUtils]: Spent 4.49m on a formula simplification. DAG size of input: 217 DAG size of output: 213 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:25:33,130 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,130 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,130 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2022-12-13 17:25:33,130 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-12-13 17:25:33,130 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2022-12-13 17:25:33,131 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,131 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,131 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-12-13 17:25:33,131 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-12-13 17:25:33,131 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 70) the Hoare annotation is: true [2022-12-13 17:25:33,131 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-12-13 17:25:33,131 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-12-13 17:25:33,131 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-12-13 17:25:33,131 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 17:25:33,131 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-12-13 17:25:33,132 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 17:25:33,132 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,132 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-12-13 17:25:33,132 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-12-13 17:25:33,132 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 17:25:33,132 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,132 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-12-13 17:25:33,132 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 17:25:33,132 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse7 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= .cse7 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse7))) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4)) (and .cse1 .cse5 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse5 .cse3 .cse6)))) [2022-12-13 17:25:33,132 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 35 68) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~l~0#1| 1)) (.cse6 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= .cse1 |ULTIMATE.start_main_~r~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (<= .cse1 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 (<= (+ 2 |ULTIMATE.start_main_~r~0#1|) .cse1) (<= .cse1 (+ 2 |ULTIMATE.start_main_~n~0#1|)) .cse2) (and (<= .cse3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse5 .cse6 .cse7 .cse2) (and .cse0 .cse5 .cse6 (<= (+ 2 |ULTIMATE.start_main_~r~0#1| .cse3) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) .cse7 .cse2) (and (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse1)) .cse4 .cse5 .cse7 .cse2)))) [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-12-13 17:25:33,133 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2022-12-13 17:25:33,134 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-12-13 17:25:33,134 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-12-13 17:25:33,134 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-12-13 17:25:33,136 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:25:33,138 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:25:33,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:25:33 BoogieIcfgContainer [2022-12-13 17:25:33,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:25:33,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:25:33,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:25:33,148 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:25:33,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:18:28" (3/4) ... [2022-12-13 17:25:33,150 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 17:25:33,155 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 17:25:33,157 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-12-13 17:25:33,157 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 17:25:33,157 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 17:25:33,158 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 17:25:33,158 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 17:25:33,185 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:25:33,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:25:33,186 INFO L158 Benchmark]: Toolchain (without parser) took 425387.37ms. Allocated memory was 113.2MB in the beginning and 799.0MB in the end (delta: 685.8MB). Free memory was 62.0MB in the beginning and 560.8MB in the end (delta: -498.9MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,186 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:25:33,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.73ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 61.7MB in the beginning and 120.3MB in the end (delta: -58.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.77ms. Allocated memory is still 151.0MB. Free memory was 120.3MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,187 INFO L158 Benchmark]: Boogie Preprocessor took 20.02ms. Allocated memory is still 151.0MB. Free memory was 118.5MB in the beginning and 117.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,187 INFO L158 Benchmark]: RCFGBuilder took 245.22ms. Allocated memory is still 151.0MB. Free memory was 117.4MB in the beginning and 105.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,187 INFO L158 Benchmark]: TraceAbstraction took 424841.30ms. Allocated memory was 151.0MB in the beginning and 799.0MB in the end (delta: 648.0MB). Free memory was 104.8MB in the beginning and 565.0MB in the end (delta: -460.2MB). Peak memory consumption was 466.4MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,188 INFO L158 Benchmark]: Witness Printer took 37.01ms. Allocated memory is still 799.0MB. Free memory was 564.0MB in the beginning and 560.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:25:33,189 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.12ms. Allocated memory is still 113.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.73ms. Allocated memory was 113.2MB in the beginning and 151.0MB in the end (delta: 37.7MB). Free memory was 61.7MB in the beginning and 120.3MB in the end (delta: -58.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.77ms. Allocated memory is still 151.0MB. Free memory was 120.3MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.02ms. Allocated memory is still 151.0MB. Free memory was 118.5MB in the beginning and 117.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.22ms. Allocated memory is still 151.0MB. Free memory was 117.4MB in the beginning and 105.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 424841.30ms. Allocated memory was 151.0MB in the beginning and 799.0MB in the end (delta: 648.0MB). Free memory was 104.8MB in the beginning and 565.0MB in the end (delta: -460.2MB). Peak memory consumption was 466.4MB. Max. memory is 16.1GB. * Witness Printer took 37.01ms. Allocated memory is still 799.0MB. Free memory was 564.0MB in the beginning and 560.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 424.8s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 413.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1480 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 4521 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3159 mSDsCounter, 2394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6233 IncrementalHoareTripleChecker+Invalid, 8627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2394 mSolverCounterUnsat, 1362 mSDtfsCounter, 6233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=17, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 813 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 684 PreInvPairs, 1094 NumberOfFragments, 730 HoareAnnotationTreeSize, 684 FomulaSimplifications, 2804560 FormulaSimplificationTreeSizeReduction, 406.9s HoareSimplificationTime, 18 FomulaSimplificationsInter, 44867391 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1313 ConstructedInterpolants, 0 QuantifiedInterpolants, 3094 SizeOfPredicates, 15 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 4823/4899 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((l <= 1 && 2 + r <= 2 * l) && 2 * l <= 2 + n) && 1 <= l) || (((((2 * i <= j && 2 * l <= r) && r <= n) && 2 <= j) && 2 * l <= n) && 1 <= l)) || (((((l <= 1 && r <= n) && 2 <= j) && 2 + r + 2 * i <= 2 * n + j) && 2 * l <= n) && 1 <= l)) || ((((r <= 2 + 2 * l && 2 * l <= r) && r <= n) && 2 * l <= n) && 1 <= l) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((1 <= i && 2 * i <= j) && 2 * l <= r) && r <= n) && j <= 2 * l) || (((((2 * i <= j && 2 + j <= r + 2 * i) && 2 * l <= r) && r <= n) && 2 <= i) && 1 <= l)) || (((((l <= 1 && 1 <= i) && 2 * i <= j) && 2 + j <= r + 2 * i) && r <= n) && 1 <= l) RESULT: Ultimate proved your program to be correct! [2022-12-13 17:25:33,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdd79218-b085-4071-a9d7-1cf3150fb48e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE