./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:26:22,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:26:22,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:26:22,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:26:22,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:26:22,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:26:22,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:26:22,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:26:22,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:26:22,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:26:22,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:26:22,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:26:22,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:26:22,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:26:22,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:26:22,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:26:22,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:26:22,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:26:22,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:26:22,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:26:22,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:26:22,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:26:22,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:26:22,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:26:22,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:26:22,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:26:22,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:26:22,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:26:22,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:26:22,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:26:22,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:26:22,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:26:22,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:26:22,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:26:22,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:26:22,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:26:22,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:26:22,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:26:22,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:26:22,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:26:22,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:26:22,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:26:22,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:26:22,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:26:22,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:26:22,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:26:22,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:26:22,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:26:22,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:26:22,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:26:22,933 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:26:22,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:26:22,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:26:22,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:26:22,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:26:22,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:26:22,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:26:22,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:26:22,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:26:22,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:26:22,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:26:22,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:26:22,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:26:22,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:26:22,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:26:22,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:26:22,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:26:22,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:26:22,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:26:22,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:26:22,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:26:22,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:26:22,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:26:22,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:26:22,943 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:26:22,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:26:22,944 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_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2022-11-25 18:26:23,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:26:23,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:26:23,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:26:23,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:26:23,290 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:26:23,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-11-25 18:26:26,405 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:26:26,648 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:26:26,648 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-11-25 18:26:26,658 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/data/dbb5ee67e/cce3b2a0214c45a7946e2331adc3234a/FLAG631753607 [2022-11-25 18:26:26,675 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/data/dbb5ee67e/cce3b2a0214c45a7946e2331adc3234a [2022-11-25 18:26:26,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:26:26,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:26:26,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:26:26,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:26:26,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:26:26,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:26:26" (1/1) ... [2022-11-25 18:26:26,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7496d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:26, skipping insertion in model container [2022-11-25 18:26:26,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:26:26" (1/1) ... [2022-11-25 18:26:26,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:26:26,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:26:26,910 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_b6f5b6e4-2363-4219-b858-3fa6429b4afc/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-11-25 18:26:26,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:26:26,973 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:26:26,991 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_b6f5b6e4-2363-4219-b858-3fa6429b4afc/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-11-25 18:26:27,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:26:27,046 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:26:27,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27 WrapperNode [2022-11-25 18:26:27,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:26:27,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:26:27,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:26:27,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:26:27,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,110 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2022-11-25 18:26:27,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:26:27,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:26:27,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:26:27,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:26:27,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,150 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:26:27,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:26:27,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:26:27,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:26:27,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (1/1) ... [2022-11-25 18:26:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:26:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:26:27,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:26:27,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:26:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:26:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:26:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:26:27,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:26:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:26:27,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:26:27,330 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:26:27,334 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:26:27,612 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:26:27,618 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:26:27,619 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:26:27,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:26:27 BoogieIcfgContainer [2022-11-25 18:26:27,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:26:27,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:26:27,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:26:27,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:26:27,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:26:26" (1/3) ... [2022-11-25 18:26:27,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2490571c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:26:27, skipping insertion in model container [2022-11-25 18:26:27,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:26:27" (2/3) ... [2022-11-25 18:26:27,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2490571c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:26:27, skipping insertion in model container [2022-11-25 18:26:27,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:26:27" (3/3) ... [2022-11-25 18:26:27,631 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-11-25 18:26:27,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:26:27,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:26:27,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:26:27,742 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;@72e673be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:26:27,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:26:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:26:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:26:27,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:27,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:27,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 92647790, now seen corresponding path program 1 times [2022-11-25 18:26:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:27,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995191990] [2022-11-25 18:26:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:28,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995191990] [2022-11-25 18:26:28,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995191990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:28,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:28,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:26:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057295153] [2022-11-25 18:26:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:28,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:26:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:26:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:26:28,361 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-25 18:26:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:28,632 INFO L93 Difference]: Finished difference Result 107 states and 201 transitions. [2022-11-25 18:26:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:26:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-11-25 18:26:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:28,649 INFO L225 Difference]: With dead ends: 107 [2022-11-25 18:26:28,649 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 18:26:28,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-25 18:26:28,662 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:28,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:26:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 18:26:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-11-25 18:26:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:26:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-11-25 18:26:28,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 13 [2022-11-25 18:26:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:28,749 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-11-25 18:26:28,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-25 18:26:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-11-25 18:26:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:26:28,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:28,753 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:28,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:26:28,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816530, now seen corresponding path program 1 times [2022-11-25 18:26:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64291604] [2022-11-25 18:26:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:26:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:28,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64291604] [2022-11-25 18:26:28,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64291604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:28,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:28,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:26:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530055067] [2022-11-25 18:26:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:26:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:26:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:26:28,951 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-25 18:26:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:29,218 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-11-25 18:26:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:26:29,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2022-11-25 18:26:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:29,231 INFO L225 Difference]: With dead ends: 59 [2022-11-25 18:26:29,231 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 18:26:29,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-11-25 18:26:29,233 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:29,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:26:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 18:26:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 18:26:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:26:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-11-25 18:26:29,249 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2022-11-25 18:26:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:29,250 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-11-25 18:26:29,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11-25 18:26:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-11-25 18:26:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:26:29,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:29,252 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2022-11-25 18:26:29,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:26:29,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash 323306105, now seen corresponding path program 1 times [2022-11-25 18:26:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:29,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239050439] [2022-11-25 18:26:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:26:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:26:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:26:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:26:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:26:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 18:26:29,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:29,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239050439] [2022-11-25 18:26:29,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239050439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:29,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:29,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:26:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376234347] [2022-11-25 18:26:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:29,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:26:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:29,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:26:29,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:26:29,356 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:26:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:29,432 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2022-11-25 18:26:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:26:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-11-25 18:26:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:29,438 INFO L225 Difference]: With dead ends: 86 [2022-11-25 18:26:29,438 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 18:26:29,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-11-25 18:26:29,450 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:29,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:26:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 18:26:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 18:26:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:26:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2022-11-25 18:26:29,475 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 47 [2022-11-25 18:26:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:29,476 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2022-11-25 18:26:29,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:26:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2022-11-25 18:26:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 18:26:29,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:29,479 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1] [2022-11-25 18:26:29,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:26:29,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -353292279, now seen corresponding path program 1 times [2022-11-25 18:26:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:29,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210334416] [2022-11-25 18:26:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:26:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:26:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:26:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:26:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:26:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 18:26:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:29,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210334416] [2022-11-25 18:26:29,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210334416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:29,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:29,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:26:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811463767] [2022-11-25 18:26:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:29,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:26:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:26:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:26:29,698 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:26:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:29,901 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-11-25 18:26:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:26:29,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-11-25 18:26:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:29,903 INFO L225 Difference]: With dead ends: 64 [2022-11-25 18:26:29,904 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 18:26:29,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:29,905 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:29,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:26:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 18:26:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-11-25 18:26:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:26:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-11-25 18:26:29,929 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 48 [2022-11-25 18:26:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:29,929 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-11-25 18:26:29,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:26:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-11-25 18:26:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:26:29,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:29,931 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:29,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:26:29,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:29,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash 89962133, now seen corresponding path program 1 times [2022-11-25 18:26:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:29,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231783522] [2022-11-25 18:26:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:26:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:26:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:26:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:26:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:26:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:26:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 18:26:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:26:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:26:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 18:26:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 18:26:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-25 18:26:30,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:30,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231783522] [2022-11-25 18:26:30,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231783522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:30,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:26:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226343697] [2022-11-25 18:26:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:30,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:26:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:30,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:26:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:26:30,200 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:26:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:30,273 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-11-25 18:26:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:26:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-11-25 18:26:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:30,275 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:26:30,275 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 18:26:30,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:30,276 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:30,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:26:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 18:26:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-11-25 18:26:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 18:26:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-11-25 18:26:30,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 83 [2022-11-25 18:26:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:30,290 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-11-25 18:26:30,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:26:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-11-25 18:26:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 18:26:30,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:30,292 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:30,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:26:30,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1632378009, now seen corresponding path program 1 times [2022-11-25 18:26:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:30,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780567931] [2022-11-25 18:26:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:26:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 18:26:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:26:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:26:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:26:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:26:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 18:26:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:26:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:26:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 18:26:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 18:26:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 18:26:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-25 18:26:30,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:30,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780567931] [2022-11-25 18:26:30,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780567931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:30,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:30,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:26:30,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674305457] [2022-11-25 18:26:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:30,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:26:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:26:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:26:30,534 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-25 18:26:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:30,632 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-11-25 18:26:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:26:30,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 88 [2022-11-25 18:26:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:30,635 INFO L225 Difference]: With dead ends: 71 [2022-11-25 18:26:30,636 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:26:30,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:30,640 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:30,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:26:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:26:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:26:30,645 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-11-25 18:26:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:26:30,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-11-25 18:26:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:30,646 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:26:30,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-25 18:26:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:26:30,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:26:30,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:26:30,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:26:30,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:26:31,104 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-11-25 18:26:31,105 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-11-25 18:26:31,105 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-11-25 18:26:31,105 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-11-25 18:26:31,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:26:31,105 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-11-25 18:26:31,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:26:31,106 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,106 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,106 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,106 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-11-25 18:26:31,106 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-11-25 18:26:31,107 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,107 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,107 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,107 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,107 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,108 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,108 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,108 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,108 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,108 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-11-25 18:26:31,108 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-25 18:26:31,109 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,109 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-11-25 18:26:31,109 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2))) [2022-11-25 18:26:31,109 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:26:31,109 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-11-25 18:26:31,109 INFO L902 garLoopResultBuilder]: At program point L82(lines 24 83) the Hoare annotation is: true [2022-11-25 18:26:31,109 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) [2022-11-25 18:26:31,110 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,110 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-25 18:26:31,110 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:26:31,110 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-11-25 18:26:31,110 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,110 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-11-25 18:26:31,111 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse3 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse4 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-11-25 18:26:31,111 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-11-25 18:26:31,111 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse3 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse4 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-11-25 18:26:31,111 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-25 18:26:31,111 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-11-25 18:26:31,111 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-11-25 18:26:31,111 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-11-25 18:26:31,111 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-11-25 18:26:31,112 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-11-25 18:26:31,112 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-11-25 18:26:31,112 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-25 18:26:31,112 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-25 18:26:31,112 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-25 18:26:31,115 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-25 18:26:31,117 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:26:31,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:26:31 BoogieIcfgContainer [2022-11-25 18:26:31,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:26:31,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:26:31,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:26:31,135 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:26:31,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:26:27" (3/4) ... [2022-11-25 18:26:31,138 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:26:31,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 18:26:31,152 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-25 18:26:31,153 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 18:26:31,153 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:26:31,153 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:26:31,202 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:26:31,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:26:31,202 INFO L158 Benchmark]: Toolchain (without parser) took 4523.17ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 140.1MB in the end (delta: 11.5MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-11-25 18:26:31,203 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:26:31,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.05ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 140.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 18:26:31,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.49ms. Allocated memory is still 197.1MB. Free memory was 140.0MB in the beginning and 138.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:26:31,204 INFO L158 Benchmark]: Boogie Preprocessor took 41.21ms. Allocated memory is still 197.1MB. Free memory was 138.4MB in the beginning and 137.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:26:31,204 INFO L158 Benchmark]: RCFGBuilder took 468.21ms. Allocated memory is still 197.1MB. Free memory was 137.3MB in the beginning and 123.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 18:26:31,204 INFO L158 Benchmark]: TraceAbstraction took 3510.06ms. Allocated memory is still 197.1MB. Free memory was 123.2MB in the beginning and 144.3MB in the end (delta: -21.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-25 18:26:31,204 INFO L158 Benchmark]: Witness Printer took 67.48ms. Allocated memory is still 197.1MB. Free memory was 144.3MB in the beginning and 140.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:26:31,206 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.29ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.05ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 140.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.49ms. Allocated memory is still 197.1MB. Free memory was 140.0MB in the beginning and 138.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.21ms. Allocated memory is still 197.1MB. Free memory was 138.4MB in the beginning and 137.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 468.21ms. Allocated memory is still 197.1MB. Free memory was 137.3MB in the beginning and 123.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3510.06ms. Allocated memory is still 197.1MB. Free memory was 123.2MB in the beginning and 144.3MB in the end (delta: -21.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 67.48ms. Allocated memory is still 197.1MB. Free memory was 144.3MB in the beginning and 140.1MB in the end (delta: 4.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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 1135 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 763 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 460 IncrementalHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 372 mSDtfsCounter, 460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 73 PreInvPairs, 104 NumberOfFragments, 456 HoareAnnotationTreeSize, 73 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 280 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 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: 46]: Loop Invariant Derived loop invariant: (cp + 1 <= urilen && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((cp < urilen && c == 0) && 1 <= cp) && 0 < scheme + 1) || (((cp < urilen && 1 <= c) && 1 <= cp) && 0 < scheme + 1) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 18:26:31,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f5b6e4-2363-4219-b858-3fa6429b4afc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE