./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:41:22,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:41:22,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:41:22,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:41:22,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:41:22,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:41:22,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:41:22,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:41:22,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:41:22,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:41:22,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:41:22,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:41:22,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:41:22,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:41:22,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:41:22,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:41:22,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:41:22,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:41:22,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:41:22,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:41:22,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:41:22,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:41:22,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:41:22,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:41:22,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:41:22,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:41:22,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:41:22,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:41:22,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:41:22,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:41:22,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:41:22,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:41:22,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:41:23,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:41:23,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:41:23,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:41:23,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:41:23,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:41:23,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:41:23,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:41:23,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:41:23,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:41:23,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:41:23,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:41:23,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:41:23,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:41:23,024 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:41:23,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:41:23,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:41:23,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:41:23,025 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:41:23,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:41:23,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:41:23,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:41:23,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:41:23,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:41:23,028 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:41:23,028 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_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b [2022-12-13 12:41:23,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:41:23,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:41:23,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:41:23,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:41:23,243 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:41:23,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-12-13 12:41:25,865 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:41:26,129 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:41:26,129 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-12-13 12:41:26,144 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/data/195aea1dd/c1159b6defe045468a694ec29130e820/FLAG596e3bb6b [2022-12-13 12:41:26,157 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/data/195aea1dd/c1159b6defe045468a694ec29130e820 [2022-12-13 12:41:26,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:41:26,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:41:26,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:41:26,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:41:26,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:41:26,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:26" (1/1) ... [2022-12-13 12:41:26,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bca525b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:26, skipping insertion in model container [2022-12-13 12:41:26,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:26" (1/1) ... [2022-12-13 12:41:26,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:41:26,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:41:26,403 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_326ca317-d345-458a-8212-cfa630135d7e/sv-benchmarks/c/eca-rers2012/Problem15_label11.c[6732,6745] [2022-12-13 12:41:26,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:41:26,784 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:41:26,810 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_326ca317-d345-458a-8212-cfa630135d7e/sv-benchmarks/c/eca-rers2012/Problem15_label11.c[6732,6745] [2022-12-13 12:41:27,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:41:27,015 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:41:27,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27 WrapperNode [2022-12-13 12:41:27,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:41:27,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:41:27,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:41:27,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:41:27,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,188 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-12-13 12:41:27,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:41:27,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:41:27,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:41:27,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:41:27,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,315 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:41:27,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:41:27,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:41:27,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:41:27,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (1/1) ... [2022-12-13 12:41:27,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:41:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:41:27,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:41:27,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:41:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:41:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:41:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:41:27,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:41:27,467 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:41:27,469 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:41:29,644 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:41:29,651 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:41:29,652 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:41:29,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:29 BoogieIcfgContainer [2022-12-13 12:41:29,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:41:29,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:41:29,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:41:29,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:41:29,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:41:26" (1/3) ... [2022-12-13 12:41:29,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3da304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:29, skipping insertion in model container [2022-12-13 12:41:29,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:27" (2/3) ... [2022-12-13 12:41:29,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3da304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:29, skipping insertion in model container [2022-12-13 12:41:29,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:29" (3/3) ... [2022-12-13 12:41:29,660 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2022-12-13 12:41:29,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:41:29,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:41:29,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:41:29,722 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;@60b0620c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:41:29,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:41:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 12:41:29,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:29,740 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:29,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2022-12-13 12:41:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:29,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934873265] [2022-12-13 12:41:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:41:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934873265] [2022-12-13 12:41:30,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934873265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:30,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:30,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:41:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283670625] [2022-12-13 12:41:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:30,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:30,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:30,046 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:32,238 INFO L93 Difference]: Finished difference Result 1197 states and 2163 transitions. [2022-12-13 12:41:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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) Word has length 55 [2022-12-13 12:41:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:32,250 INFO L225 Difference]: With dead ends: 1197 [2022-12-13 12:41:32,250 INFO L226 Difference]: Without dead ends: 694 [2022-12-13 12:41:32,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:32,255 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 363 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:32,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-13 12:41:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-12-13 12:41:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2022-12-13 12:41:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.718887262079063) internal successors, (1174), 683 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2022-12-13 12:41:32,305 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 55 [2022-12-13 12:41:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:32,305 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2022-12-13 12:41:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2022-12-13 12:41:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-13 12:41:32,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:32,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:41:32,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1666804951, now seen corresponding path program 1 times [2022-12-13 12:41:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:32,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909978565] [2022-12-13 12:41:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:41:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909978565] [2022-12-13 12:41:32,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909978565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:32,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:41:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687521899] [2022-12-13 12:41:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:32,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:32,549 INFO L87 Difference]: Start difference. First operand 684 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:34,183 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2022-12-13 12:41:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:34,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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) Word has length 120 [2022-12-13 12:41:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:34,186 INFO L225 Difference]: With dead ends: 1681 [2022-12-13 12:41:34,186 INFO L226 Difference]: Without dead ends: 999 [2022-12-13 12:41:34,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:34,188 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:34,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 12:41:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-12-13 12:41:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2022-12-13 12:41:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.6194331983805668) internal successors, (1600), 988 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2022-12-13 12:41:34,210 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 120 [2022-12-13 12:41:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:34,210 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2022-12-13 12:41:34,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2022-12-13 12:41:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-13 12:41:34,212 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:34,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:34,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:41:34,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2119716484, now seen corresponding path program 1 times [2022-12-13 12:41:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:34,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539045581] [2022-12-13 12:41:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:41:34,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539045581] [2022-12-13 12:41:34,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539045581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:34,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:34,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:41:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449696749] [2022-12-13 12:41:34,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:34,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:34,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:34,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:34,316 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:35,664 INFO L93 Difference]: Finished difference Result 2575 states and 4255 transitions. [2022-12-13 12:41:35,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:35,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) Word has length 121 [2022-12-13 12:41:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:35,670 INFO L225 Difference]: With dead ends: 2575 [2022-12-13 12:41:35,670 INFO L226 Difference]: Without dead ends: 1588 [2022-12-13 12:41:35,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:35,673 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:35,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 12:41:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-12-13 12:41:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584. [2022-12-13 12:41:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.3986102337334176) internal successors, (2214), 1583 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2214 transitions. [2022-12-13 12:41:35,705 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2214 transitions. Word has length 121 [2022-12-13 12:41:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:35,705 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2214 transitions. [2022-12-13 12:41:35,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2214 transitions. [2022-12-13 12:41:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 12:41:35,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:35,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:35,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:41:35,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1178280902, now seen corresponding path program 1 times [2022-12-13 12:41:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:35,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881817907] [2022-12-13 12:41:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:41:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881817907] [2022-12-13 12:41:35,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881817907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:35,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:35,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:41:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191774660] [2022-12-13 12:41:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:35,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:41:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:41:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:41:35,901 INFO L87 Difference]: Start difference. First operand 1584 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:37,815 INFO L93 Difference]: Finished difference Result 4090 states and 5888 transitions. [2022-12-13 12:41:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:41:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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) Word has length 125 [2022-12-13 12:41:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:37,821 INFO L225 Difference]: With dead ends: 4090 [2022-12-13 12:41:37,821 INFO L226 Difference]: Without dead ends: 2807 [2022-12-13 12:41:37,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:41:37,823 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 347 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:37,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 416 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 12:41:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-12-13 12:41:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2184. [2022-12-13 12:41:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2183 states have (on average 1.3302794319743472) internal successors, (2904), 2183 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2904 transitions. [2022-12-13 12:41:37,854 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2904 transitions. Word has length 125 [2022-12-13 12:41:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:37,854 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 2904 transitions. [2022-12-13 12:41:37,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2904 transitions. [2022-12-13 12:41:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-12-13 12:41:37,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:37,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:37,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:41:37,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2088752626, now seen corresponding path program 1 times [2022-12-13 12:41:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:37,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468638953] [2022-12-13 12:41:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-13 12:41:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:38,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468638953] [2022-12-13 12:41:38,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468638953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:38,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:38,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:41:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812660384] [2022-12-13 12:41:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:38,136 INFO L87 Difference]: Start difference. First operand 2184 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:39,614 INFO L93 Difference]: Finished difference Result 5868 states and 7890 transitions. [2022-12-13 12:41:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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) Word has length 325 [2022-12-13 12:41:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:39,621 INFO L225 Difference]: With dead ends: 5868 [2022-12-13 12:41:39,621 INFO L226 Difference]: Without dead ends: 3686 [2022-12-13 12:41:39,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:39,623 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:39,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 12:41:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-12-13 12:41:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2022-12-13 12:41:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3683 states have (on average 1.25821341297855) internal successors, (4634), 3683 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions. [2022-12-13 12:41:39,668 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 325 [2022-12-13 12:41:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:39,669 INFO L495 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions. [2022-12-13 12:41:39,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions. [2022-12-13 12:41:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-12-13 12:41:39,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:39,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:39,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:41:39,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1998947477, now seen corresponding path program 1 times [2022-12-13 12:41:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:39,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831379889] [2022-12-13 12:41:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 12:41:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:40,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831379889] [2022-12-13 12:41:40,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831379889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:40,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:40,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:41:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417881891] [2022-12-13 12:41:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:40,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:40,137 INFO L87 Difference]: Start difference. First operand 3684 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:41,642 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions. [2022-12-13 12:41:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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) Word has length 373 [2022-12-13 12:41:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:41,650 INFO L225 Difference]: With dead ends: 7665 [2022-12-13 12:41:41,650 INFO L226 Difference]: Without dead ends: 3983 [2022-12-13 12:41:41,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:41,653 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:41,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 12:41:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2022-12-13 12:41:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983. [2022-12-13 12:41:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3982 states have (on average 1.2403314917127073) internal successors, (4939), 3982 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions. [2022-12-13 12:41:41,701 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 373 [2022-12-13 12:41:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:41,701 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions. [2022-12-13 12:41:41,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions. [2022-12-13 12:41:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-12-13 12:41:41,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:41,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:41:41,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1174077085, now seen corresponding path program 1 times [2022-12-13 12:41:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547340385] [2022-12-13 12:41:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 12:41:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:41,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547340385] [2022-12-13 12:41:41,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547340385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:41,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:41,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269215037] [2022-12-13 12:41:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:41,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:41,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:41,940 INFO L87 Difference]: Start difference. First operand 3983 states and 4939 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:43,836 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions. [2022-12-13 12:41:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) Word has length 416 [2022-12-13 12:41:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:43,844 INFO L225 Difference]: With dead ends: 8861 [2022-12-13 12:41:43,844 INFO L226 Difference]: Without dead ends: 5179 [2022-12-13 12:41:43,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:43,846 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 259 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:43,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 12:41:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2022-12-13 12:41:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381. [2022-12-13 12:41:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.26301775147929) internal successors, (4269), 3380 states have internal predecessors, (4269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions. [2022-12-13 12:41:43,893 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 416 [2022-12-13 12:41:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:43,894 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions. [2022-12-13 12:41:43,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions. [2022-12-13 12:41:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2022-12-13 12:41:43,896 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:43,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:43,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:41:43,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1674238342, now seen corresponding path program 1 times [2022-12-13 12:41:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:43,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157402906] [2022-12-13 12:41:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:41:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157402906] [2022-12-13 12:41:44,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157402906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:44,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:44,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:41:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044937912] [2022-12-13 12:41:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:44,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:41:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:41:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:41:44,409 INFO L87 Difference]: Start difference. First operand 3381 states and 4269 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:46,443 INFO L93 Difference]: Finished difference Result 8301 states and 10750 transitions. [2022-12-13 12:41:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:41:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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) Word has length 420 [2022-12-13 12:41:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:46,451 INFO L225 Difference]: With dead ends: 8301 [2022-12-13 12:41:46,452 INFO L226 Difference]: Without dead ends: 5221 [2022-12-13 12:41:46,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:41:46,454 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 352 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:46,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 716 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 12:41:46,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2022-12-13 12:41:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4880. [2022-12-13 12:41:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4879 states have (on average 1.2059848329575733) internal successors, (5884), 4879 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 5884 transitions. [2022-12-13 12:41:46,524 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 5884 transitions. Word has length 420 [2022-12-13 12:41:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:46,525 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 5884 transitions. [2022-12-13 12:41:46,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 5884 transitions. [2022-12-13 12:41:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-12-13 12:41:46,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:46,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1] [2022-12-13 12:41:46,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:41:46,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash 381390040, now seen corresponding path program 1 times [2022-12-13 12:41:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:46,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313618274] [2022-12-13 12:41:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-12-13 12:41:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313618274] [2022-12-13 12:41:46,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313618274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:46,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:46,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53747168] [2022-12-13 12:41:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:46,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:46,858 INFO L87 Difference]: Start difference. First operand 4880 states and 5884 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:48,266 INFO L93 Difference]: Finished difference Result 10956 states and 13581 transitions. [2022-12-13 12:41:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:48,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) Word has length 432 [2022-12-13 12:41:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:48,277 INFO L225 Difference]: With dead ends: 10956 [2022-12-13 12:41:48,277 INFO L226 Difference]: Without dead ends: 6377 [2022-12-13 12:41:48,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:48,280 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 273 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:48,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 618 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 12:41:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2022-12-13 12:41:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 6374. [2022-12-13 12:41:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6374 states, 6373 states have (on average 1.1828024478267691) internal successors, (7538), 6373 states have internal predecessors, (7538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 7538 transitions. [2022-12-13 12:41:48,337 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 7538 transitions. Word has length 432 [2022-12-13 12:41:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:48,337 INFO L495 AbstractCegarLoop]: Abstraction has 6374 states and 7538 transitions. [2022-12-13 12:41:48,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 7538 transitions. [2022-12-13 12:41:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2022-12-13 12:41:48,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:48,341 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1] [2022-12-13 12:41:48,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:41:48,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1616945835, now seen corresponding path program 1 times [2022-12-13 12:41:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:48,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48158521] [2022-12-13 12:41:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-12-13 12:41:48,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:48,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48158521] [2022-12-13 12:41:48,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48158521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:48,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:48,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:48,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673187497] [2022-12-13 12:41:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:48,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:48,597 INFO L87 Difference]: Start difference. First operand 6374 states and 7538 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:50,612 INFO L93 Difference]: Finished difference Result 16633 states and 19881 transitions. [2022-12-13 12:41:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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) Word has length 529 [2022-12-13 12:41:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:50,624 INFO L225 Difference]: With dead ends: 16633 [2022-12-13 12:41:50,625 INFO L226 Difference]: Without dead ends: 10560 [2022-12-13 12:41:50,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:50,629 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 285 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:50,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 263 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 12:41:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-12-13 12:41:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 8467. [2022-12-13 12:41:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8467 states, 8466 states have (on average 1.1804866524923223) internal successors, (9994), 8466 states have internal predecessors, (9994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 9994 transitions. [2022-12-13 12:41:50,708 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 9994 transitions. Word has length 529 [2022-12-13 12:41:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:50,709 INFO L495 AbstractCegarLoop]: Abstraction has 8467 states and 9994 transitions. [2022-12-13 12:41:50,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 9994 transitions. [2022-12-13 12:41:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2022-12-13 12:41:50,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:50,713 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:41:50,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1652572232, now seen corresponding path program 1 times [2022-12-13 12:41:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681476901] [2022-12-13 12:41:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-12-13 12:41:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:51,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681476901] [2022-12-13 12:41:51,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681476901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:51,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:51,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107756223] [2022-12-13 12:41:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:51,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:51,023 INFO L87 Difference]: Start difference. First operand 8467 states and 9994 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:52,858 INFO L93 Difference]: Finished difference Result 19936 states and 23667 transitions. [2022-12-13 12:41:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:52,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) Word has length 546 [2022-12-13 12:41:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:52,871 INFO L225 Difference]: With dead ends: 19936 [2022-12-13 12:41:52,871 INFO L226 Difference]: Without dead ends: 11770 [2022-12-13 12:41:52,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:52,875 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 243 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:52,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 619 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 12:41:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2022-12-13 12:41:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 11758. [2022-12-13 12:41:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11758 states, 11757 states have (on average 1.1626265203708428) internal successors, (13669), 11757 states have internal predecessors, (13669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11758 states to 11758 states and 13669 transitions. [2022-12-13 12:41:52,983 INFO L78 Accepts]: Start accepts. Automaton has 11758 states and 13669 transitions. Word has length 546 [2022-12-13 12:41:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:52,983 INFO L495 AbstractCegarLoop]: Abstraction has 11758 states and 13669 transitions. [2022-12-13 12:41:52,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11758 states and 13669 transitions. [2022-12-13 12:41:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-12-13 12:41:52,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:52,988 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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-12-13 12:41:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:41:52,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -889884113, now seen corresponding path program 1 times [2022-12-13 12:41:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:52,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308130867] [2022-12-13 12:41:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-12-13 12:41:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:53,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308130867] [2022-12-13 12:41:53,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308130867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:53,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:53,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898330700] [2022-12-13 12:41:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:53,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:53,365 INFO L87 Difference]: Start difference. First operand 11758 states and 13669 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:54,642 INFO L93 Difference]: Finished difference Result 23512 states and 27370 transitions. [2022-12-13 12:41:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) Word has length 556 [2022-12-13 12:41:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:54,659 INFO L225 Difference]: With dead ends: 23512 [2022-12-13 12:41:54,659 INFO L226 Difference]: Without dead ends: 12055 [2022-12-13 12:41:54,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:54,667 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:54,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 12:41:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2022-12-13 12:41:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 11756. [2022-12-13 12:41:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11756 states, 11755 states have (on average 1.162484049340706) internal successors, (13665), 11755 states have internal predecessors, (13665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11756 states to 11756 states and 13665 transitions. [2022-12-13 12:41:54,783 INFO L78 Accepts]: Start accepts. Automaton has 11756 states and 13665 transitions. Word has length 556 [2022-12-13 12:41:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:54,783 INFO L495 AbstractCegarLoop]: Abstraction has 11756 states and 13665 transitions. [2022-12-13 12:41:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 11756 states and 13665 transitions. [2022-12-13 12:41:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-12-13 12:41:54,788 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:54,788 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1] [2022-12-13 12:41:54,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:41:54,789 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash 967458274, now seen corresponding path program 1 times [2022-12-13 12:41:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:54,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418330543] [2022-12-13 12:41:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:54,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 12:41:55,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:55,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418330543] [2022-12-13 12:41:55,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418330543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:55,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:55,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149655427] [2022-12-13 12:41:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:55,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:55,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:55,035 INFO L87 Difference]: Start difference. First operand 11756 states and 13665 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:56,146 INFO L93 Difference]: Finished difference Result 24706 states and 28704 transitions. [2022-12-13 12:41:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:56,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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) Word has length 576 [2022-12-13 12:41:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:56,156 INFO L225 Difference]: With dead ends: 24706 [2022-12-13 12:41:56,156 INFO L226 Difference]: Without dead ends: 13251 [2022-12-13 12:41:56,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:56,163 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:56,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 12:41:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states. [2022-12-13 12:41:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 9959. [2022-12-13 12:41:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9959 states, 9958 states have (on average 1.1778469572203254) internal successors, (11729), 9958 states have internal predecessors, (11729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9959 states to 9959 states and 11729 transitions. [2022-12-13 12:41:56,256 INFO L78 Accepts]: Start accepts. Automaton has 9959 states and 11729 transitions. Word has length 576 [2022-12-13 12:41:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:56,257 INFO L495 AbstractCegarLoop]: Abstraction has 9959 states and 11729 transitions. [2022-12-13 12:41:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 9959 states and 11729 transitions. [2022-12-13 12:41:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2022-12-13 12:41:56,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:56,262 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:56,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:41:56,262 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash -270881818, now seen corresponding path program 1 times [2022-12-13 12:41:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:56,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219290083] [2022-12-13 12:41:56,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-12-13 12:41:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:56,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219290083] [2022-12-13 12:41:56,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219290083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:56,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:41:56,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:41:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106824579] [2022-12-13 12:41:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:56,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:56,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:56,651 INFO L87 Difference]: Start difference. First operand 9959 states and 11729 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:41:58,373 INFO L93 Difference]: Finished difference Result 25896 states and 30602 transitions. [2022-12-13 12:41:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:41:58,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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) Word has length 582 [2022-12-13 12:41:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:41:58,386 INFO L225 Difference]: With dead ends: 25896 [2022-12-13 12:41:58,386 INFO L226 Difference]: Without dead ends: 16238 [2022-12-13 12:41:58,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:41:58,393 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 220 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:41:58,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 207 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 12:41:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16238 states. [2022-12-13 12:41:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16238 to 12052. [2022-12-13 12:41:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12052 states, 12051 states have (on average 1.1992365778773546) internal successors, (14452), 12051 states have internal predecessors, (14452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12052 states to 12052 states and 14452 transitions. [2022-12-13 12:41:58,507 INFO L78 Accepts]: Start accepts. Automaton has 12052 states and 14452 transitions. Word has length 582 [2022-12-13 12:41:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:41:58,507 INFO L495 AbstractCegarLoop]: Abstraction has 12052 states and 14452 transitions. [2022-12-13 12:41:58,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:41:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12052 states and 14452 transitions. [2022-12-13 12:41:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2022-12-13 12:41:58,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:41:58,513 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:41:58,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:41:58,513 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:41:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:41:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash -830480631, now seen corresponding path program 1 times [2022-12-13 12:41:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:41:58,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776733766] [2022-12-13 12:41:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:41:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 599 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-12-13 12:41:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:41:59,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776733766] [2022-12-13 12:41:59,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776733766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:41:59,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342179641] [2022-12-13 12:41:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:41:59,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:41:59,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:41:59,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:41:59,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:41:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:41:59,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:41:59,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:41:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-12-13 12:41:59,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:41:59,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342179641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:41:59,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:41:59,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 12:41:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735521292] [2022-12-13 12:41:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:41:59,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:41:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:41:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:41:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:41:59,321 INFO L87 Difference]: Start difference. First operand 12052 states and 14452 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:42:01,029 INFO L93 Difference]: Finished difference Result 27093 states and 33239 transitions. [2022-12-13 12:42:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:42:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) Word has length 619 [2022-12-13 12:42:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:42:01,041 INFO L225 Difference]: With dead ends: 27093 [2022-12-13 12:42:01,041 INFO L226 Difference]: Without dead ends: 15342 [2022-12-13 12:42:01,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:42:01,048 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 269 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:42:01,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 626 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 12:42:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15342 states. [2022-12-13 12:42:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15342 to 14445. [2022-12-13 12:42:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14445 states, 14444 states have (on average 1.1806286347272223) internal successors, (17053), 14444 states have internal predecessors, (17053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14445 states to 14445 states and 17053 transitions. [2022-12-13 12:42:01,186 INFO L78 Accepts]: Start accepts. Automaton has 14445 states and 17053 transitions. Word has length 619 [2022-12-13 12:42:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:42:01,187 INFO L495 AbstractCegarLoop]: Abstraction has 14445 states and 17053 transitions. [2022-12-13 12:42:01,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14445 states and 17053 transitions. [2022-12-13 12:42:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2022-12-13 12:42:01,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:42:01,195 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:42:01,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:42:01,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:42:01,396 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:42:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1205457609, now seen corresponding path program 1 times [2022-12-13 12:42:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:42:01,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280414674] [2022-12-13 12:42:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:42:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-12-13 12:42:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:42:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280414674] [2022-12-13 12:42:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280414674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:42:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345371951] [2022-12-13 12:42:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:02,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:42:02,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:42:02,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:42:02,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:42:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:02,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:42:02,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-12-13 12:42:02,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:42:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-12-13 12:42:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345371951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:42:03,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:42:03,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 12:42:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178464333] [2022-12-13 12:42:03,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:42:03,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:42:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:42:03,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:42:03,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:42:03,424 INFO L87 Difference]: Start difference. First operand 14445 states and 17053 transitions. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:42:08,909 INFO L93 Difference]: Finished difference Result 36221 states and 42291 transitions. [2022-12-13 12:42:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:42:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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) Word has length 676 [2022-12-13 12:42:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:42:08,921 INFO L225 Difference]: With dead ends: 36221 [2022-12-13 12:42:08,922 INFO L226 Difference]: Without dead ends: 16838 [2022-12-13 12:42:08,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1361 GetRequests, 1346 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:42:08,928 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2888 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 6290 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2888 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 6863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 6290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:42:08,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2888 Valid, 299 Invalid, 6863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 6290 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-12-13 12:42:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16838 states. [2022-12-13 12:42:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16838 to 16835. [2022-12-13 12:42:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16835 states, 16834 states have (on average 1.0624331709635262) internal successors, (17885), 16834 states have internal predecessors, (17885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16835 states to 16835 states and 17885 transitions. [2022-12-13 12:42:09,073 INFO L78 Accepts]: Start accepts. Automaton has 16835 states and 17885 transitions. Word has length 676 [2022-12-13 12:42:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:42:09,073 INFO L495 AbstractCegarLoop]: Abstraction has 16835 states and 17885 transitions. [2022-12-13 12:42:09,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 16835 states and 17885 transitions. [2022-12-13 12:42:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2022-12-13 12:42:09,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:42:09,079 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:42:09,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:42:09,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 12:42:09,281 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:42:09,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 547646301, now seen corresponding path program 1 times [2022-12-13 12:42:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:42:09,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12050927] [2022-12-13 12:42:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:09,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:42:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-12-13 12:42:09,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:42:09,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12050927] [2022-12-13 12:42:09,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12050927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:09,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:09,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:42:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101322135] [2022-12-13 12:42:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:09,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:42:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:42:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:42:09,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:42:09,730 INFO L87 Difference]: Start difference. First operand 16835 states and 17885 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:42:10,596 INFO L93 Difference]: Finished difference Result 35460 states and 37672 transitions. [2022-12-13 12:42:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:42:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) Word has length 684 [2022-12-13 12:42:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:42:10,609 INFO L225 Difference]: With dead ends: 35460 [2022-12-13 12:42:10,609 INFO L226 Difference]: Without dead ends: 18926 [2022-12-13 12:42:10,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:42:10,617 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 229 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:42:10,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 499 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 12:42:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18926 states. [2022-12-13 12:42:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18926 to 18328. [2022-12-13 12:42:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18328 states, 18327 states have (on average 1.0486167948927811) internal successors, (19218), 18327 states have internal predecessors, (19218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18328 states to 18328 states and 19218 transitions. [2022-12-13 12:42:10,834 INFO L78 Accepts]: Start accepts. Automaton has 18328 states and 19218 transitions. Word has length 684 [2022-12-13 12:42:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:42:10,834 INFO L495 AbstractCegarLoop]: Abstraction has 18328 states and 19218 transitions. [2022-12-13 12:42:10,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18328 states and 19218 transitions. [2022-12-13 12:42:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2022-12-13 12:42:10,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:42:10,848 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1] [2022-12-13 12:42:10,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:42:10,848 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:42:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 696512821, now seen corresponding path program 1 times [2022-12-13 12:42:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:42:10,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501046295] [2022-12-13 12:42:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:42:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-12-13 12:42:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:42:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501046295] [2022-12-13 12:42:11,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501046295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:11,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:11,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:42:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063649401] [2022-12-13 12:42:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:11,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:42:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:42:11,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:42:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:42:11,474 INFO L87 Difference]: Start difference. First operand 18328 states and 19218 transitions. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:42:12,701 INFO L93 Difference]: Finished difference Result 42361 states and 44395 transitions. [2022-12-13 12:42:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:42:12,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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) Word has length 732 [2022-12-13 12:42:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:42:12,718 INFO L225 Difference]: With dead ends: 42361 [2022-12-13 12:42:12,718 INFO L226 Difference]: Without dead ends: 24334 [2022-12-13 12:42:12,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:42:12,729 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 371 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:42:12,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 491 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 12:42:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24334 states. [2022-12-13 12:42:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24334 to 22534. [2022-12-13 12:42:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.043580526339147) internal successors, (23515), 22533 states have internal predecessors, (23515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 23515 transitions. [2022-12-13 12:42:12,937 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 23515 transitions. Word has length 732 [2022-12-13 12:42:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:42:12,937 INFO L495 AbstractCegarLoop]: Abstraction has 22534 states and 23515 transitions. [2022-12-13 12:42:12,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 23515 transitions. [2022-12-13 12:42:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-12-13 12:42:12,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:42:12,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:42:12,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:42:12,944 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:42:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1684182335, now seen corresponding path program 1 times [2022-12-13 12:42:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:42:12,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261852463] [2022-12-13 12:42:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:42:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 563 proven. 188 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-12-13 12:42:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:42:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261852463] [2022-12-13 12:42:13,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261852463] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:42:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159009872] [2022-12-13 12:42:13,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:13,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:42:13,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:42:13,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:42:13,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:42:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:14,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:42:14,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:21,093 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 50 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:42:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2022-12-13 12:42:22,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:42:22,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159009872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:22,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:42:22,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 12:42:22,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506621955] [2022-12-13 12:42:22,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:22,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:42:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:42:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:42:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:42:22,034 INFO L87 Difference]: Start difference. First operand 22534 states and 23515 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:24,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:26,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:30,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:33,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:36,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:40,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:43,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:44,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:46,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:47,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:49,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:51,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:53,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:55,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:42:59,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:02,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:04,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:07,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:10,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:12,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:14,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:16,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:19,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:21,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:23,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:25,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:28,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:31,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:43:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:31,325 INFO L93 Difference]: Finished difference Result 49280 states and 51452 transitions. [2022-12-13 12:43:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:31,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) Word has length 746 [2022-12-13 12:43:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:31,348 INFO L225 Difference]: With dead ends: 49280 [2022-12-13 12:43:31,348 INFO L226 Difference]: Without dead ends: 27047 [2022-12-13 12:43:31,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:43:31,358 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 305 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 138 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:31,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 105 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 769 Invalid, 20 Unknown, 0 Unchecked, 69.1s Time] [2022-12-13 12:43:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27047 states. [2022-12-13 12:43:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27047 to 21636. [2022-12-13 12:43:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21636 states, 21635 states have (on average 1.0434018950774209) internal successors, (22574), 21635 states have internal predecessors, (22574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21636 states to 21636 states and 22574 transitions. [2022-12-13 12:43:31,572 INFO L78 Accepts]: Start accepts. Automaton has 21636 states and 22574 transitions. Word has length 746 [2022-12-13 12:43:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:31,572 INFO L495 AbstractCegarLoop]: Abstraction has 21636 states and 22574 transitions. [2022-12-13 12:43:31,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21636 states and 22574 transitions. [2022-12-13 12:43:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2022-12-13 12:43:31,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:31,583 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:31,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 12:43:31,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:43:31,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:31,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 341621360, now seen corresponding path program 1 times [2022-12-13 12:43:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:31,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329239046] [2022-12-13 12:43:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-12-13 12:43:32,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:32,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329239046] [2022-12-13 12:43:32,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329239046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:32,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:32,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:43:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138861684] [2022-12-13 12:43:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:32,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:43:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:32,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:43:32,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:43:32,878 INFO L87 Difference]: Start difference. First operand 21636 states and 22574 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:33,970 INFO L93 Difference]: Finished difference Result 43757 states and 45643 transitions. [2022-12-13 12:43:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:43:33,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) Word has length 865 [2022-12-13 12:43:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:33,984 INFO L225 Difference]: With dead ends: 43757 [2022-12-13 12:43:33,984 INFO L226 Difference]: Without dead ends: 22422 [2022-12-13 12:43:33,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:33,991 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 314 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:33,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 627 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 12:43:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2022-12-13 12:43:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22236. [2022-12-13 12:43:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22236 states, 22235 states have (on average 1.0424106138970093) internal successors, (23178), 22235 states have internal predecessors, (23178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22236 states to 22236 states and 23178 transitions. [2022-12-13 12:43:34,188 INFO L78 Accepts]: Start accepts. Automaton has 22236 states and 23178 transitions. Word has length 865 [2022-12-13 12:43:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:34,189 INFO L495 AbstractCegarLoop]: Abstraction has 22236 states and 23178 transitions. [2022-12-13 12:43:34,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22236 states and 23178 transitions. [2022-12-13 12:43:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2022-12-13 12:43:34,201 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:34,202 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:34,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:43:34,202 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1669164797, now seen corresponding path program 1 times [2022-12-13 12:43:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367343020] [2022-12-13 12:43:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-12-13 12:43:34,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:34,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367343020] [2022-12-13 12:43:34,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367343020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:34,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:34,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:43:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631047997] [2022-12-13 12:43:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:34,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:43:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:34,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:43:34,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:34,749 INFO L87 Difference]: Start difference. First operand 22236 states and 23178 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:35,607 INFO L93 Difference]: Finished difference Result 44467 states and 46366 transitions. [2022-12-13 12:43:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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) Word has length 895 [2022-12-13 12:43:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:35,621 INFO L225 Difference]: With dead ends: 44467 [2022-12-13 12:43:35,621 INFO L226 Difference]: Without dead ends: 22532 [2022-12-13 12:43:35,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:35,630 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 248 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:35,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 450 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 12:43:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2022-12-13 12:43:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 21036. [2022-12-13 12:43:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21036 states, 21035 states have (on average 1.0418350368433562) internal successors, (21915), 21035 states have internal predecessors, (21915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 21915 transitions. [2022-12-13 12:43:35,822 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 21915 transitions. Word has length 895 [2022-12-13 12:43:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:35,823 INFO L495 AbstractCegarLoop]: Abstraction has 21036 states and 21915 transitions. [2022-12-13 12:43:35,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 21915 transitions. [2022-12-13 12:43:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-12-13 12:43:35,834 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:35,834 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:35,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 12:43:35,835 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1629824559, now seen corresponding path program 1 times [2022-12-13 12:43:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:35,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503092755] [2022-12-13 12:43:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 871 proven. 531 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 12:43:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503092755] [2022-12-13 12:43:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503092755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:43:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796315377] [2022-12-13 12:43:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:43:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:43:37,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:43:37,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 12:43:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:38,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 12:43:38,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:43:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-12-13 12:43:38,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:43:38,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796315377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:38,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:43:38,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 12:43:38,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160087964] [2022-12-13 12:43:38,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:38,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:43:38,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:38,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:43:38,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:43:38,172 INFO L87 Difference]: Start difference. First operand 21036 states and 21915 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:39,084 INFO L93 Difference]: Finished difference Result 41169 states and 42896 transitions. [2022-12-13 12:43:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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) Word has length 900 [2022-12-13 12:43:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:39,098 INFO L225 Difference]: With dead ends: 41169 [2022-12-13 12:43:39,098 INFO L226 Difference]: Without dead ends: 20434 [2022-12-13 12:43:39,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:43:39,106 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 226 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:39,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 459 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 12:43:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20434 states. [2022-12-13 12:43:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20434 to 20434. [2022-12-13 12:43:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20434 states, 20433 states have (on average 1.0308324768756423) internal successors, (21063), 20433 states have internal predecessors, (21063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20434 states to 20434 states and 21063 transitions. [2022-12-13 12:43:39,287 INFO L78 Accepts]: Start accepts. Automaton has 20434 states and 21063 transitions. Word has length 900 [2022-12-13 12:43:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:39,288 INFO L495 AbstractCegarLoop]: Abstraction has 20434 states and 21063 transitions. [2022-12-13 12:43:39,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20434 states and 21063 transitions. [2022-12-13 12:43:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2022-12-13 12:43:39,299 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:39,299 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:39,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 12:43:39,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 12:43:39,501 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:39,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash -470354541, now seen corresponding path program 1 times [2022-12-13 12:43:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:39,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191678956] [2022-12-13 12:43:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2022-12-13 12:43:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:40,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191678956] [2022-12-13 12:43:40,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191678956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:40,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:40,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:43:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439677574] [2022-12-13 12:43:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:43:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:43:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:40,789 INFO L87 Difference]: Start difference. First operand 20434 states and 21063 transitions. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:42,455 INFO L93 Difference]: Finished difference Result 42845 states and 44137 transitions. [2022-12-13 12:43:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:43:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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) Word has length 919 [2022-12-13 12:43:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:42,468 INFO L225 Difference]: With dead ends: 42845 [2022-12-13 12:43:42,469 INFO L226 Difference]: Without dead ends: 22712 [2022-12-13 12:43:42,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:43:42,476 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 634 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:42,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 649 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 12:43:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22712 states. [2022-12-13 12:43:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22712 to 20434. [2022-12-13 12:43:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20434 states, 20433 states have (on average 1.0307835364361573) internal successors, (21062), 20433 states have internal predecessors, (21062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20434 states to 20434 states and 21062 transitions. [2022-12-13 12:43:42,668 INFO L78 Accepts]: Start accepts. Automaton has 20434 states and 21062 transitions. Word has length 919 [2022-12-13 12:43:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:42,668 INFO L495 AbstractCegarLoop]: Abstraction has 20434 states and 21062 transitions. [2022-12-13 12:43:42,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 20434 states and 21062 transitions. [2022-12-13 12:43:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2022-12-13 12:43:42,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:42,680 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:42,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:43:42,680 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1011364661, now seen corresponding path program 1 times [2022-12-13 12:43:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:42,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264170162] [2022-12-13 12:43:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:42,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 1270 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-12-13 12:43:44,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:44,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264170162] [2022-12-13 12:43:44,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264170162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:44,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:44,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:43:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346157133] [2022-12-13 12:43:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:44,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:43:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:43:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:43:44,004 INFO L87 Difference]: Start difference. First operand 20434 states and 21062 transitions. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:45,578 INFO L93 Difference]: Finished difference Result 41930 states and 43200 transitions. [2022-12-13 12:43:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:43:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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) Word has length 952 [2022-12-13 12:43:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:45,592 INFO L225 Difference]: With dead ends: 41930 [2022-12-13 12:43:45,593 INFO L226 Difference]: Without dead ends: 21797 [2022-12-13 12:43:45,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:43:45,600 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 528 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:45,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 671 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 12:43:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21797 states. [2022-12-13 12:43:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21797 to 17732. [2022-12-13 12:43:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17732 states, 17731 states have (on average 1.0327674694038689) internal successors, (18312), 17731 states have internal predecessors, (18312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17732 states to 17732 states and 18312 transitions. [2022-12-13 12:43:45,773 INFO L78 Accepts]: Start accepts. Automaton has 17732 states and 18312 transitions. Word has length 952 [2022-12-13 12:43:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:45,773 INFO L495 AbstractCegarLoop]: Abstraction has 17732 states and 18312 transitions. [2022-12-13 12:43:45,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17732 states and 18312 transitions. [2022-12-13 12:43:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2022-12-13 12:43:45,790 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:45,790 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:45,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 12:43:45,790 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1022383996, now seen corresponding path program 1 times [2022-12-13 12:43:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:45,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281151574] [2022-12-13 12:43:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1459 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2022-12-13 12:43:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281151574] [2022-12-13 12:43:46,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281151574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:46,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:46,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:43:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491790722] [2022-12-13 12:43:46,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:46,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:43:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:43:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:46,368 INFO L87 Difference]: Start difference. First operand 17732 states and 18312 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:47,230 INFO L93 Difference]: Finished difference Result 35163 states and 36321 transitions. [2022-12-13 12:43:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) Word has length 1012 [2022-12-13 12:43:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:47,243 INFO L225 Difference]: With dead ends: 35163 [2022-12-13 12:43:47,243 INFO L226 Difference]: Without dead ends: 17732 [2022-12-13 12:43:47,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:47,251 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 238 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:47,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 489 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 12:43:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17732 states. [2022-12-13 12:43:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17732 to 17132. [2022-12-13 12:43:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17132 states, 17131 states have (on average 1.0281361274881793) internal successors, (17613), 17131 states have internal predecessors, (17613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17132 states to 17132 states and 17613 transitions. [2022-12-13 12:43:47,420 INFO L78 Accepts]: Start accepts. Automaton has 17132 states and 17613 transitions. Word has length 1012 [2022-12-13 12:43:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:47,420 INFO L495 AbstractCegarLoop]: Abstraction has 17132 states and 17613 transitions. [2022-12-13 12:43:47,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17132 states and 17613 transitions. [2022-12-13 12:43:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2022-12-13 12:43:47,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:47,434 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:47,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 12:43:47,434 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1553755039, now seen corresponding path program 1 times [2022-12-13 12:43:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:47,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624737670] [2022-12-13 12:43:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2022-12-13 12:43:48,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624737670] [2022-12-13 12:43:48,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624737670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:43:48,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:43:48,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:43:48,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442723859] [2022-12-13 12:43:48,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:43:48,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:43:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:43:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:48,237 INFO L87 Difference]: Start difference. First operand 17132 states and 17613 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:43:49,035 INFO L93 Difference]: Finished difference Result 29441 states and 30147 transitions. [2022-12-13 12:43:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:43:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) Word has length 1013 [2022-12-13 12:43:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:43:49,045 INFO L225 Difference]: With dead ends: 29441 [2022-12-13 12:43:49,045 INFO L226 Difference]: Without dead ends: 12610 [2022-12-13 12:43:49,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:43:49,053 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 323 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:43:49,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 69 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 12:43:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12610 states. [2022-12-13 12:43:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12610 to 11108. [2022-12-13 12:43:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11108 states, 11107 states have (on average 1.0169262627172053) internal successors, (11295), 11107 states have internal predecessors, (11295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 11295 transitions. [2022-12-13 12:43:49,157 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 11295 transitions. Word has length 1013 [2022-12-13 12:43:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:43:49,157 INFO L495 AbstractCegarLoop]: Abstraction has 11108 states and 11295 transitions. [2022-12-13 12:43:49,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:43:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 11295 transitions. [2022-12-13 12:43:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2022-12-13 12:43:49,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:43:49,170 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:43:49,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 12:43:49,171 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:43:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:43:49,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1574290295, now seen corresponding path program 1 times [2022-12-13 12:43:49,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:43:49,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419891473] [2022-12-13 12:43:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:43:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 1488 proven. 187 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-12-13 12:43:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:43:51,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419891473] [2022-12-13 12:43:51,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419891473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:43:51,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587723272] [2022-12-13 12:43:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:43:51,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:43:51,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:43:51,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:43:51,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 12:43:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:43:51,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:43:51,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:43:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2022-12-13 12:43:52,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:43:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2022-12-13 12:43:52,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587723272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:43:52,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:43:52,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-12-13 12:43:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781483000] [2022-12-13 12:43:52,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:43:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:43:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:43:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:43:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:43:52,296 INFO L87 Difference]: Start difference. First operand 11108 states and 11295 transitions. Second operand has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:44:04,820 INFO L93 Difference]: Finished difference Result 34075 states and 34626 transitions. [2022-12-13 12:44:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-13 12:44:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 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) Word has length 1166 [2022-12-13 12:44:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:44:04,833 INFO L225 Difference]: With dead ends: 34075 [2022-12-13 12:44:04,833 INFO L226 Difference]: Without dead ends: 23268 [2022-12-13 12:44:04,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2441 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1010, Invalid=4392, Unknown=0, NotChecked=0, Total=5402 [2022-12-13 12:44:04,838 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 12721 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 20364 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12721 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 21125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 20364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:44:04,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12721 Valid, 344 Invalid, 21125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 20364 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-12-13 12:44:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23268 states. [2022-12-13 12:44:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23268 to 11104. [2022-12-13 12:44:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11104 states, 11103 states have (on average 1.0133297307034135) internal successors, (11251), 11103 states have internal predecessors, (11251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 11251 transitions. [2022-12-13 12:44:04,979 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 11251 transitions. Word has length 1166 [2022-12-13 12:44:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:44:04,980 INFO L495 AbstractCegarLoop]: Abstraction has 11104 states and 11251 transitions. [2022-12-13 12:44:04,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 11251 transitions. [2022-12-13 12:44:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2022-12-13 12:44:04,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:44:04,993 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:44:04,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 12:44:05,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 12:44:05,196 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:44:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:44:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash 550818549, now seen corresponding path program 1 times [2022-12-13 12:44:05,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:44:05,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066812492] [2022-12-13 12:44:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:44:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:44:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:44:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2022-12-13 12:44:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:44:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066812492] [2022-12-13 12:44:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066812492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:44:06,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:44:06,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:44:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437493407] [2022-12-13 12:44:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:44:06,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:44:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:44:06,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:44:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:44:06,371 INFO L87 Difference]: Start difference. First operand 11104 states and 11251 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:44:07,672 INFO L93 Difference]: Finished difference Result 14104 states and 14288 transitions. [2022-12-13 12:44:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:44:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) Word has length 1223 [2022-12-13 12:44:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:44:07,673 INFO L225 Difference]: With dead ends: 14104 [2022-12-13 12:44:07,673 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:44:07,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:44:07,676 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 396 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:44:07,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 50 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 12:44:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:44:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:44:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:44:07,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1223 [2022-12-13 12:44:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:44:07,676 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:44:07,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:44:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:44:07,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:44:07,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:44:07,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 12:44:07,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:45:08,287 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 780 DAG size of output: 762 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 12:46:14,565 WARN L233 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 786 DAG size of output: 765 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 12:46:36,078 WARN L233 SmtUtils]: Spent 21.51s on a formula simplification. DAG size of input: 762 DAG size of output: 177 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 12:46:48,497 WARN L233 SmtUtils]: Spent 12.41s on a formula simplification. DAG size of input: 447 DAG size of output: 157 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 12:47:15,658 WARN L233 SmtUtils]: Spent 27.16s on a formula simplification. DAG size of input: 765 DAG size of output: 179 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 12:47:15,661 INFO L899 garLoopResultBuilder]: For program point L630(lines 630 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,661 INFO L899 garLoopResultBuilder]: For program point L1423(lines 1423 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L895(lines 895 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1160(lines 1160 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 904) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L896-2(lines 896 904) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1029 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1429(lines 1429 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1430(lines 1430 1440) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1430-2(lines 1430 1440) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1166(lines 1166 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,662 INFO L899 garLoopResultBuilder]: For program point L1695(lines 1695 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1299(lines 1299 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1696(lines 1696 1703) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1696-2(lines 1696 1703) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1300(lines 1300 1309) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1300-2(lines 1300 1309) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1036 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L905(lines 905 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1040(lines 1040 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-12-13 12:47:15,663 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1704(lines 1704 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1045(lines 1045 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1178(lines 1178 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 661) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 661) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,664 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1448(lines 1448 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1591) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1581-2(lines 1581 1591) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1449(lines 1449 1458) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1449-2(lines 1449 1458) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1716(lines 1716 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-12-13 12:47:15,665 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 182) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1059(lines 1059 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1720(lines 1720 1731) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1720-2(lines 1720 1731) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 538) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 538) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1071) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1060-2(lines 1060 1071) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 412) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 401 412) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L1194(lines 1194 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,666 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1459(lines 1459 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1327(lines 1327 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L935(lines 935 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1332(lines 1332 1342) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1332-2(lines 1332 1342) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 813) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L804-2(lines 804 813) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 551) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 540 551) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,667 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L1732(lines 1732 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L1072(lines 1072 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L1073(lines 1073 1083) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L1073-2(lines 1073 1083) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-12-13 12:47:15,668 INFO L895 garLoopResultBuilder]: At program point calculate_output2_returnLabel#1(lines 1668 1768) the Hoare annotation is: (let ((.cse11 (+ ~a29~0 127))) (let ((.cse31 (+ ~a4~0 86)) (.cse4 (<= 0 .cse11)) (.cse1 (<= (+ 89 ~a4~0) 0))) (let ((.cse20 (<= 0 (+ 146 ~a0~0))) (.cse34 (and .cse4 .cse1)) (.cse22 (<= 0 (+ ~a0~0 60))) (.cse23 (<= .cse31 0))) (let ((.cse27 (and .cse20 (or .cse34 (and .cse4 .cse22 .cse23))))) (let ((.cse24 (or .cse27 .cse34)) (.cse7 (<= 5 ~a2~0)) (.cse30 (+ ~a29~0 16)) (.cse16 (= 3 ~a2~0))) (let ((.cse5 (not .cse23)) (.cse18 (<= 44 ~a29~0)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse25 (or (and .cse4 .cse23 .cse16) (and .cse1 .cse16))) (.cse13 (<= (+ 216075 ~a0~0) 0)) (.cse21 (= ~a2~0 4)) (.cse9 (<= .cse30 0)) (.cse2 (<= (+ ~a0~0 61) 0)) (.cse15 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse0 (= 2 ~a2~0)) (.cse6 (<= (+ 98 ~a0~0) 0)) (.cse28 (or (and .cse24 .cse7) (and .cse1 .cse7))) (.cse10 (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse32 (mod (+ (div .cse33 10) 1) 63))) (and (<= .cse32 (+ ~a29~0 143)) (not (= (mod .cse33 10) 0)) (not (= .cse32 0)) (< .cse33 0)))))) (.cse8 (= ~a2~0 1)) (.cse26 (<= ~a29~0 43)) (.cse12 (< 0 .cse31)) (.cse3 (<= (+ 42 ~a4~0) 0)) (.cse19 (<= (+ ~a0~0 99) 0)) (.cse17 (<= 0 (+ 599999 ~a29~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and (<= 0 (+ 97 ~a0~0)) .cse3 .cse8 .cse9 .cse2 .cse10) (and .cse4 .cse1 .cse8 (<= 0 (+ 44 ~a0~0)) (<= .cse11 0)) (and .cse12 (or (and .cse13 .cse3 .cse14 .cse7) (and .cse3 .cse14 .cse7 .cse10)) (< 0 (+ ~a29~0 144))) (and .cse12 .cse3 .cse14 .cse15 .cse16) (and .cse12 .cse3 .cse0 .cse14 .cse17) (and .cse3 .cse18 .cse14 .cse7) (and .cse3 .cse4 .cse14 .cse16) (and .cse3 .cse19 .cse5 .cse20 .cse16) (and .cse12 .cse3 .cse14 .cse21 .cse17) (and .cse0 .cse22 .cse23 .cse17) (and .cse8 .cse23 .cse2) (and .cse12 .cse3 .cse6 (<= (+ ~a29~0 120873) 0) .cse16) (and .cse24 .cse2) (and .cse3 .cse18 .cse14 .cse8) (and .cse25 .cse2) (and .cse3 .cse6 .cse20 .cse8 .cse26 .cse17) (and .cse25 .cse17) (and .cse1 .cse20 .cse2) (and .cse13 .cse3 .cse8 .cse10) (and (or .cse27 (and .cse1 .cse10)) .cse21 .cse26) (and .cse1 .cse20 .cse21 .cse9 .cse17) (and .cse28 .cse2) (let ((.cse29 (< 0 .cse30))) (and .cse12 (or .cse15 .cse29) .cse3 .cse0 .cse4 .cse6 (or .cse29 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))))) (and .cse28 .cse10) (and .cse12 .cse3 .cse4 .cse8 .cse26) (and .cse12 .cse3 .cse19 .cse20 .cse7 .cse17)))))))) [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1471(lines 1471 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1605(lines 1605 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L945(lines 945 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-12-13 12:47:15,669 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L1745(lines 1745 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L160-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 566) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L557-2(lines 557 566) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L1218(lines 1218 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L1483(lines 1483 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,670 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L895 garLoopResultBuilder]: At program point calculate_output_returnLabel#1(lines 33 1666) the Hoare annotation is: (let ((.cse32 (+ ~a29~0 127))) (let ((.cse31 (+ ~a4~0 86)) (.cse4 (<= 0 .cse32)) (.cse1 (<= (+ 89 ~a4~0) 0))) (let ((.cse19 (<= 0 (+ 146 ~a0~0))) (.cse33 (and .cse4 .cse1)) (.cse21 (<= 0 (+ ~a0~0 60))) (.cse22 (<= .cse31 0))) (let ((.cse26 (and .cse19 (or .cse33 (and .cse4 .cse21 .cse22))))) (let ((.cse24 (or .cse26 .cse33)) (.cse7 (<= 5 ~a2~0))) (let ((.cse18 (<= (+ ~a0~0 99) 0)) (.cse13 (<= (+ ~a0~0 147) 0)) (.cse5 (not .cse22)) (.cse16 (<= (+ ~a29~0 144) 0)) (.cse17 (<= (+ 216075 ~a0~0) 0)) (.cse8 (= ~a2~0 1)) (.cse11 (<= .cse32 0)) (.cse25 (<= ~a29~0 43)) (.cse20 (= ~a2~0 4)) (.cse14 (<= 0 (+ 599999 ~a29~0))) (.cse15 (= 3 ~a2~0)) (.cse2 (<= (+ ~a0~0 61) 0)) (.cse12 (< 0 .cse31)) (.cse3 (<= (+ 42 ~a4~0) 0)) (.cse0 (= 2 ~a2~0)) (.cse6 (<= (+ 98 ~a0~0) 0)) (.cse23 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse9 (<= (+ ~a29~0 16) 0)) (.cse27 (or (and .cse24 .cse7) (and .cse1 .cse7))) (.cse10 (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse29 (mod (+ (div .cse30 10) 1) 63))) (and (<= .cse29 (+ ~a29~0 143)) (not (= (mod .cse30 10) 0)) (not (= .cse29 0)) (< .cse30 0))))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and (<= 0 (+ 97 ~a0~0)) .cse3 .cse8 .cse9 .cse2 .cse10) (and .cse4 .cse1 .cse8 (<= 0 (+ 44 ~a0~0)) .cse11) (and .cse12 .cse3 .cse0 .cse13 .cse14) (and .cse3 (<= 44 ~a29~0) .cse13 .cse7) (and .cse3 .cse4 .cse13 .cse15) (and .cse3 .cse5 (not .cse16) (or (and .cse17 .cse13 .cse7) (and .cse13 .cse7 .cse10))) (and .cse12 .cse3 .cse18 .cse19 (not .cse20) (<= 4 ~a2~0) .cse14) (and .cse3 .cse18 .cse5 .cse19 .cse15) (and .cse12 .cse3 .cse13 .cse20 .cse14) (and .cse0 .cse21 .cse22 .cse14) (and .cse3 .cse5 .cse13 .cse23 .cse15) (and .cse8 .cse22 .cse2) (and .cse12 .cse3 .cse6 (<= (+ ~a29~0 120873) 0) .cse15) (and .cse12 .cse3 .cse13 .cse15 .cse16) (and .cse24 .cse2) (and .cse3 .cse4 .cse13 .cse8) (and .cse3 .cse4 .cse5 .cse8 .cse25) (and (or (and .cse4 .cse22 .cse15) (and .cse1 .cse15)) .cse14) (and .cse8 .cse22 .cse16) (and .cse1 .cse19 .cse2) (and .cse17 .cse3 .cse8 .cse10) (and .cse3 .cse6 .cse19 .cse8 .cse11 .cse14) (and (or .cse26 (and .cse1 .cse10)) .cse20 .cse25) (and .cse1 .cse19 .cse20 .cse9 .cse14) (and .cse27 .cse2) (and .cse1 .cse15 .cse2) (let ((.cse28 (not .cse9))) (and .cse12 .cse3 .cse0 .cse4 .cse6 (or .cse28 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))) (or .cse28 .cse23))) (and .cse27 .cse10)))))))) [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L1091(lines 1091 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L827(lines 827 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L1752(lines 1752 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L1488(lines 1488 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,671 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L169-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1632) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1623-2(lines 1623 1632) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1492(lines 1492 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 578) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L568-2(lines 568 578) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1361(lines 1361 1368) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1361-2(lines 1361 1368) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,672 INFO L899 garLoopResultBuilder]: For program point L1759(lines 1759 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L175-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 716) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L704-2(lines 704 716) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L969(lines 969 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L1498(lines 1498 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 849) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L840-2(lines 840 849) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,673 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1504(lines 1504 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1241(lines 1241 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L184-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1109(lines 1109 1117) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1109-2(lines 1109 1117) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L902 garLoopResultBuilder]: At program point L1770(lines 1770 1786) the Hoare annotation is: true [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 329) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L317-2(lines 317 329) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L1375(lines 1375 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,674 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 596) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 596) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L850(lines 850 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L1511(lines 1511 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L899 garLoopResultBuilder]: For program point L983(lines 983 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,675 INFO L895 garLoopResultBuilder]: At program point L1776-2(lines 1776 1785) the Hoare annotation is: (let ((.cse32 (+ ~a29~0 127))) (let ((.cse31 (+ ~a4~0 86)) (.cse4 (<= 0 .cse32)) (.cse1 (<= (+ 89 ~a4~0) 0))) (let ((.cse19 (<= 0 (+ 146 ~a0~0))) (.cse33 (and .cse4 .cse1)) (.cse21 (<= 0 (+ ~a0~0 60))) (.cse22 (<= .cse31 0))) (let ((.cse26 (and .cse19 (or .cse33 (and .cse4 .cse21 .cse22))))) (let ((.cse24 (or .cse26 .cse33)) (.cse7 (<= 5 ~a2~0))) (let ((.cse18 (<= (+ ~a0~0 99) 0)) (.cse13 (<= (+ ~a0~0 147) 0)) (.cse5 (not .cse22)) (.cse16 (<= (+ ~a29~0 144) 0)) (.cse17 (<= (+ 216075 ~a0~0) 0)) (.cse8 (= ~a2~0 1)) (.cse11 (<= .cse32 0)) (.cse25 (<= ~a29~0 43)) (.cse20 (= ~a2~0 4)) (.cse14 (<= 0 (+ 599999 ~a29~0))) (.cse15 (= 3 ~a2~0)) (.cse2 (<= (+ ~a0~0 61) 0)) (.cse12 (< 0 .cse31)) (.cse3 (<= (+ 42 ~a4~0) 0)) (.cse0 (= 2 ~a2~0)) (.cse6 (<= (+ 98 ~a0~0) 0)) (.cse23 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse9 (<= (+ ~a29~0 16) 0)) (.cse27 (or (and .cse24 .cse7) (and .cse1 .cse7))) (.cse10 (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse29 (mod (+ (div .cse30 10) 1) 63))) (and (<= .cse29 (+ ~a29~0 143)) (not (= (mod .cse30 10) 0)) (not (= .cse29 0)) (< .cse30 0))))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and (<= 0 (+ 97 ~a0~0)) .cse3 .cse8 .cse9 .cse2 .cse10) (and .cse4 .cse1 .cse8 (<= 0 (+ 44 ~a0~0)) .cse11) (and .cse12 .cse3 .cse0 .cse13 .cse14) (and .cse3 (<= 44 ~a29~0) .cse13 .cse7) (and .cse3 .cse4 .cse13 .cse15) (and .cse3 .cse5 (not .cse16) (or (and .cse17 .cse13 .cse7) (and .cse13 .cse7 .cse10))) (and .cse12 .cse3 .cse18 .cse19 (not .cse20) (<= 4 ~a2~0) .cse14) (and .cse3 .cse18 .cse5 .cse19 .cse15) (and .cse12 .cse3 .cse13 .cse20 .cse14) (and .cse0 .cse21 .cse22 .cse14) (and .cse3 .cse5 .cse13 .cse23 .cse15) (and .cse8 .cse22 .cse2) (and .cse12 .cse3 .cse6 (<= (+ ~a29~0 120873) 0) .cse15) (and .cse12 .cse3 .cse13 .cse15 .cse16) (and .cse24 .cse2) (and .cse3 .cse4 .cse13 .cse8) (and .cse3 .cse4 .cse5 .cse8 .cse25) (and (or (and .cse4 .cse22 .cse15) (and .cse1 .cse15)) .cse14) (and .cse8 .cse22 .cse16) (and .cse1 .cse19 .cse2) (and .cse17 .cse3 .cse8 .cse10) (and .cse3 .cse6 .cse19 .cse8 .cse11 .cse14) (and (or .cse26 (and .cse1 .cse10)) .cse20 .cse25) (and .cse1 .cse19 .cse20 .cse9 .cse14) (and .cse27 .cse2) (and .cse1 .cse15 .cse2) (let ((.cse28 (not .cse9))) (and .cse12 .cse3 .cse0 .cse4 .cse6 (or .cse28 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))) (or .cse28 .cse23))) (and .cse27 .cse10)))))))) [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1381(lines 1381 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L193-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1118(lines 1118 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1781(line 1781) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1253(lines 1253 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L989(lines 989 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L1518(lines 1518 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-12-13 12:47:15,676 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L1521(lines 1521 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1125 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L1657(lines 1657 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L1526(lines 1526 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L205-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,677 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1395(lines 1395 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1132(lines 1132 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1265(lines 1265 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 615) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 615) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1398(lines 1398 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1002 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L1138(lines 1138 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,678 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L214-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1404(lines 1404 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1405(lines 1405 1417) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1405-2(lines 1405 1417) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1538(lines 1538 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1671(lines 1671 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 359) no Hoare annotation was computed. [2022-12-13 12:47:15,679 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 359) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1145(lines 1145 1154) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1145-2(lines 1145 1154) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L884(lines 884 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1678(lines 1678 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1766) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,680 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L758(lines 758 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L1287(lines 1287 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 238) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L230-2(lines 230 238) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 33 1666) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-12-13 12:47:15,681 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1664) no Hoare annotation was computed. [2022-12-13 12:47:15,683 INFO L445 BasicCegarLoop]: Path program histogram: [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-12-13 12:47:15,685 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:47:15,690 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,709 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,710 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:47:15 BoogieIcfgContainer [2022-12-13 12:47:15,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:47:15,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:47:15,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:47:15,724 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:47:15,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:29" (3/4) ... [2022-12-13 12:47:15,727 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:47:15,757 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 12:47:15,761 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 12:47:15,765 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:47:15,769 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:47:15,797 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((2 == a2 && 89 + a4 <= 0) && a0 + 61 <= 0) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && a29 + 16 <= 0) && a0 + 61 <= 0) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && a0 + 147 <= 0) && 0 <= 599999 + a29)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && !(a4 + 86 <= 0)) && !(a29 + 144 <= 0)) && (((216075 + a0 <= 0 && a0 + 147 <= 0) && 5 <= a2) || ((a0 + 147 <= 0 && 5 <= a2) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))))) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || (((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0)) || (((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && a2 == 1)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 + 127 <= 0) && 0 <= 599999 + a29)) || ((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) && a2 == 4) && a29 <= 43)) || ((((89 + a4 <= 0 && 0 <= 146 + a0) && a2 == 4) && a29 + 16 <= 0) && 0 <= 599999 + a29)) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || ((89 + a4 <= 0 && 3 == a2) && a0 + 61 <= 0)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4)))) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)) [2022-12-13 12:47:15,801 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((2 == a2 && 89 + a4 <= 0) && a0 + 61 <= 0) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && a29 + 16 <= 0) && a0 + 61 <= 0) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && a0 + 147 <= 0) && 0 <= 599999 + a29)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && !(a4 + 86 <= 0)) && !(a29 + 144 <= 0)) && (((216075 + a0 <= 0 && a0 + 147 <= 0) && 5 <= a2) || ((a0 + 147 <= 0 && 5 <= a2) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))))) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || (((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0)) || (((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && a2 == 1)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 + 127 <= 0) && 0 <= 599999 + a29)) || ((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) && a2 == 4) && a29 <= 43)) || ((((89 + a4 <= 0 && 0 <= 146 + a0) && a2 == 4) && a29 + 16 <= 0) && 0 <= 599999 + a29)) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || ((89 + a4 <= 0 && 3 == a2) && a0 + 61 <= 0)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4)))) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)) [2022-12-13 12:47:15,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 == a2 && 89 + a4 <= 0) && a0 + 61 <= 0) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && a29 + 16 <= 0) && a0 + 61 <= 0) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((0 < a4 + 86 && ((((216075 + a0 <= 0 && 42 + a4 <= 0) && a0 + 147 <= 0) && 5 <= a2) || (((42 + a4 <= 0 && a0 + 147 <= 0) && 5 <= a2) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 < a29 + 144)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && a0 + 147 <= 0) && 0 <= 599999 + a29)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || (((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) && a2 == 4) && a29 <= 43)) || ((((89 + a4 <= 0 && 0 <= 146 + a0) && a2 == 4) && a29 + 16 <= 0) && 0 <= 599999 + a29)) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || ((((((0 < a4 + 86 && (!(input == 4) || 0 < a29 + 16)) && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (0 < a29 + 16 || !(input == 4)))) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && 5 <= a2) && 0 <= 599999 + a29) [2022-12-13 12:47:15,931 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:47:15,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:47:15,932 INFO L158 Benchmark]: Toolchain (without parser) took 349771.46ms. Allocated memory was 134.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 94.1MB in the beginning and 355.2MB in the end (delta: -261.0MB). Peak memory consumption was 962.0MB. Max. memory is 16.1GB. [2022-12-13 12:47:15,932 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:47:15,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.89ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 93.7MB in the beginning and 104.3MB in the end (delta: -10.7MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2022-12-13 12:47:15,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.43ms. Allocated memory is still 169.9MB. Free memory was 104.3MB in the beginning and 107.6MB in the end (delta: -3.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-12-13 12:47:15,933 INFO L158 Benchmark]: Boogie Preprocessor took 168.99ms. Allocated memory is still 169.9MB. Free memory was 107.6MB in the beginning and 89.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:47:15,933 INFO L158 Benchmark]: RCFGBuilder took 2295.49ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 89.6MB in the beginning and 77.4MB in the end (delta: 12.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2022-12-13 12:47:15,933 INFO L158 Benchmark]: TraceAbstraction took 346067.65ms. Allocated memory was 205.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 77.4MB in the beginning and 379.3MB in the end (delta: -301.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 12:47:15,933 INFO L158 Benchmark]: Witness Printer took 207.79ms. Allocated memory is still 1.4GB. Free memory was 379.3MB in the beginning and 355.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 12:47:15,935 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.89ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 93.7MB in the beginning and 104.3MB in the end (delta: -10.7MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.43ms. Allocated memory is still 169.9MB. Free memory was 104.3MB in the beginning and 107.6MB in the end (delta: -3.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 168.99ms. Allocated memory is still 169.9MB. Free memory was 107.6MB in the beginning and 89.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2295.49ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 89.6MB in the beginning and 77.4MB in the end (delta: 12.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * TraceAbstraction took 346067.65ms. Allocated memory was 205.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 77.4MB in the beginning and 379.3MB in the end (delta: -301.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 207.79ms. Allocated memory is still 1.4GB. Free memory was 379.3MB in the beginning and 355.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] * 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: 182]: 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 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 346.0s, OverallIterations: 28, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 124.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 188.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 23452 SdHoareTripleChecker+Valid, 119.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23452 mSDsluCounter, 10734 SdHoareTripleChecker+Invalid, 112.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1905 mSDsCounter, 5819 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55381 IncrementalHoareTripleChecker+Invalid, 61220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5819 mSolverCounterUnsat, 8829 mSDtfsCounter, 55381 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6166 GetRequests, 6025 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22534occurred in iteration=18, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 43673 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 204 NumberOfFragments, 3069 HoareAnnotationTreeSize, 4 FomulaSimplifications, 825511 FormulaSimplificationTreeSizeReduction, 126.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1874231 FormulaSimplificationTreeSizeReductionInter, 61.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 21685 NumberOfCodeBlocks, 21685 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 23492 ConstructedInterpolants, 53 QuantifiedInterpolants, 78509 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4948 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 35 InterpolantComputations, 26 PerfectInterpolantSequences, 35042/36210 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: 33]: Loop Invariant [2022-12-13 12:47:15,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,942 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,943 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,944 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,945 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((2 == a2 && 89 + a4 <= 0) && a0 + 61 <= 0) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && a29 + 16 <= 0) && a0 + 61 <= 0) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && a0 + 147 <= 0) && 0 <= 599999 + a29)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && !(a4 + 86 <= 0)) && !(a29 + 144 <= 0)) && (((216075 + a0 <= 0 && a0 + 147 <= 0) && 5 <= a2) || ((a0 + 147 <= 0 && 5 <= a2) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))))) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || (((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0)) || (((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && a2 == 1)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 + 127 <= 0) && 0 <= 599999 + a29)) || ((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) && a2 == 4) && a29 <= 43)) || ((((89 + a4 <= 0 && 0 <= 146 + a0) && a2 == 4) && a29 + 16 <= 0) && 0 <= 599999 + a29)) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || ((89 + a4 <= 0 && 3 == a2) && a0 + 61 <= 0)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4)))) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)) - InvariantResult [Line: 1770]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1668]: Loop Invariant [2022-12-13 12:47:15,948 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,948 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,954 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,955 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,955 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((2 == a2 && 89 + a4 <= 0) && a0 + 61 <= 0) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && a29 + 16 <= 0) && a0 + 61 <= 0) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((0 < a4 + 86 && ((((216075 + a0 <= 0 && 42 + a4 <= 0) && a0 + 147 <= 0) && 5 <= a2) || (((42 + a4 <= 0 && a0 + 147 <= 0) && 5 <= a2) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 < a29 + 144)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && a0 + 147 <= 0) && 0 <= 599999 + a29)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || (((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) && a2 == 4) && a29 <= 43)) || ((((89 + a4 <= 0 && 0 <= 146 + a0) && a2 == 4) && a29 + 16 <= 0) && 0 <= 599999 + a29)) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || ((((((0 < a4 + 86 && (!(input == 4) || 0 < a29 + 16)) && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (0 < a29 + 16 || !(input == 4)))) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && 5 <= a2) && 0 <= 599999 + a29) - InvariantResult [Line: 1776]: Loop Invariant [2022-12-13 12:47:15,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,959 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,960 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,960 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,960 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,960 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,960 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,960 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-12-13 12:47:15,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((2 == a2 && 89 + a4 <= 0) && a0 + 61 <= 0) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && a29 + 16 <= 0) && a0 + 61 <= 0) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && a0 + 147 <= 0) && 0 <= 599999 + a29)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && !(a4 + 86 <= 0)) && !(a29 + 144 <= 0)) && (((216075 + a0 <= 0 && a0 + 147 <= 0) && 5 <= a2) || ((a0 + 147 <= 0 && 5 <= a2) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))))) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || (((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0)) || (((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && a2 == 1)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 + 127 <= 0) && 0 <= 599999 + a29)) || ((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) && a2 == 4) && a29 <= 43)) || ((((89 + a4 <= 0 && 0 <= 146 + a0) && a2 == 4) && a29 + 16 <= 0) && 0 <= 599999 + a29)) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || ((89 + a4 <= 0 && 3 == a2) && a0 + 61 <= 0)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4)))) || (((((0 <= 146 + a0 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) || (0 <= a29 + 127 && 89 + a4 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)) RESULT: Ultimate proved your program to be correct! [2022-12-13 12:47:15,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_326ca317-d345-458a-8212-cfa630135d7e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE