./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label31.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label31.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc --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 c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba
--- 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-5e519f3
[2022-11-02 20:47:41,800 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:47:41,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:47:41,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:47:41,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:47:41,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:47:41,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:47:41,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:47:41,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:47:41,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:47:41,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:47:41,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:47:41,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:47:41,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:47:41,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:47:41,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:47:41,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:47:41,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:47:41,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:47:41,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:47:41,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:47:41,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:47:41,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:47:41,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:47:41,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:47:41,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:47:41,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:47:41,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:47:41,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:47:41,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:47:41,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:47:41,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:47:41,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:47:41,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:47:41,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:47:41,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:47:41,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:47:41,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:47:41,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:47:41,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:47:41,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:47:41,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-02 20:47:41,962 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:47:41,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:47:41,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:47:41,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:47:41,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:47:41,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:47:41,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:47:41,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:47:41,965 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:47:41,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:47:41,967 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:47:41,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:47:41,967 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:47:41,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:47:41,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:47:41,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:47:41,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:47:41,968 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:47:41,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:47:41,969 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:47:41,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:47:41,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:47:41,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:47:41,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:47:41,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:47:41,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:47:41,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:47:41,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:47:41,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:47:41,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:47:41,971 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:47:41,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:47:41,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:47:41,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/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_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc
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 -> c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba
[2022-11-02 20:47:42,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:47:42,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:47:42,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:47:42,320 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:47:42,321 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:47:42,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/eca-rers2012/Problem15_label31.c
[2022-11-02 20:47:42,400 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/data/8cdfb0e94/fc7a3e0f521c4c138d241d804a1a0f77/FLAG71451193d
[2022-11-02 20:47:43,136 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:47:43,137 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/sv-benchmarks/c/eca-rers2012/Problem15_label31.c
[2022-11-02 20:47:43,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/data/8cdfb0e94/fc7a3e0f521c4c138d241d804a1a0f77/FLAG71451193d
[2022-11-02 20:47:43,274 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/data/8cdfb0e94/fc7a3e0f521c4c138d241d804a1a0f77
[2022-11-02 20:47:43,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:47:43,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:47:43,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:47:43,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:47:43,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:47:43,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:43" (1/1) ...
[2022-11-02 20:47:43,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcc080c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:43, skipping insertion in model container
[2022-11-02 20:47:43,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:43" (1/1) ...
[2022-11-02 20:47:43,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:47:43,413 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:47:43,790 WARN L230 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_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/sv-benchmarks/c/eca-rers2012/Problem15_label31.c[7892,7905]
[2022-11-02 20:47:44,313 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:47:44,323 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:47:44,390 WARN L230 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_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/sv-benchmarks/c/eca-rers2012/Problem15_label31.c[7892,7905]
[2022-11-02 20:47:44,700 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:47:44,719 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:47:44,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44 WrapperNode
[2022-11-02 20:47:44,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:47:44,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:47:44,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:47:44,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:47:44,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:44,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,008 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758
[2022-11-02 20:47:45,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:47:45,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:47:45,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:47:45,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:47:45,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:47:45,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:47:45,287 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:47:45,287 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:47:45,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ...
[2022-11-02 20:47:45,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:47:45,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:47:45,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:47:45,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:47:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:47:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:47:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:47:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:47:45,454 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:47:45,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:47:48,936 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:47:48,953 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:47:48,954 INFO L300 CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-02 20:47:48,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:48 BoogieIcfgContainer
[2022-11-02 20:47:48,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:47:48,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:47:48,961 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:47:48,965 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:47:48,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:43" (1/3) ...
[2022-11-02 20:47:48,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1ba28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:48, skipping insertion in model container
[2022-11-02 20:47:48,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (2/3) ...
[2022-11-02 20:47:48,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1ba28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:48, skipping insertion in model container
[2022-11-02 20:47:48,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:48" (3/3) ...
[2022-11-02 20:47:48,968 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label31.c
[2022-11-02 20:47:48,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:47:48,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-02 20:47:49,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:47:49,064 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;@c1b573a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:47:49,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-02 20:47:49,071 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-11-02 20:47:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2022-11-02 20:47:49,081 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:49,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:49,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 962891993, now seen corresponding path program 1 times
[2022-11-02 20:47:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:49,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116984230]
[2022-11-02 20:47:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:49,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116984230]
[2022-11-02 20:47:49,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116984230] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:49,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:49,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:47:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292303950]
[2022-11-02 20:47:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:49,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:47:49,575 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 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:52,602 INFO L93 Difference]: Finished difference Result 1197 states and 2163 transitions.
[2022-11-02 20:47:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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 65
[2022-11-02 20:47:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:52,623 INFO L225 Difference]: With dead ends: 1197
[2022-11-02 20:47:52,624 INFO L226 Difference]: Without dead ends: 694
[2022-11-02 20:47:52,628 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-11-02 20:47:52,634 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 353 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 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.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:52,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2022-11-02 20:47:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states.
[2022-11-02 20:47:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684.
[2022-11-02 20:47:52,734 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-11-02 20:47:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions.
[2022-11-02 20:47:52,738 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 65
[2022-11-02 20:47:52,739 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:52,739 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions.
[2022-11-02 20:47:52,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions.
[2022-11-02 20:47:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2022-11-02 20:47:52,752 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:52,752 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:52,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:47:52,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -597315905, now seen corresponding path program 1 times
[2022-11-02 20:47:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:52,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629032099]
[2022-11-02 20:47:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:53,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:53,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629032099]
[2022-11-02 20:47:53,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629032099] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:53,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:53,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:47:53,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528569196]
[2022-11-02 20:47:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:53,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:47:53,250 INFO L87 Difference]: Start difference. First operand 684 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:55,837 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions.
[2022-11-02 20:47:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 130
[2022-11-02 20:47:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:55,848 INFO L225 Difference]: With dead ends: 1681
[2022-11-02 20:47:55,848 INFO L226 Difference]: Without dead ends: 999
[2022-11-02 20:47:55,851 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-11-02 20:47:55,852 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:55,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2022-11-02 20:47:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states.
[2022-11-02 20:47:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989.
[2022-11-02 20:47:55,881 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-11-02 20:47:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions.
[2022-11-02 20:47:55,886 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 130
[2022-11-02 20:47:55,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:55,887 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions.
[2022-11-02 20:47:55,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions.
[2022-11-02 20:47:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2022-11-02 20:47:55,890 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:55,890 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:55,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:47:55,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 729994212, now seen corresponding path program 1 times
[2022-11-02 20:47:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:55,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198929903]
[2022-11-02 20:47:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:56,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198929903]
[2022-11-02 20:47:56,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198929903] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:56,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:56,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:47:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685962046]
[2022-11-02 20:47:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:56,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:47:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:47:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:47:56,058 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:47:58,058 INFO L93 Difference]: Finished difference Result 2575 states and 4255 transitions.
[2022-11-02 20:47:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:47:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131
[2022-11-02 20:47:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:47:58,066 INFO L225 Difference]: With dead ends: 2575
[2022-11-02 20:47:58,066 INFO L226 Difference]: Without dead ends: 1588
[2022-11-02 20:47:58,068 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-11-02 20:47:58,069 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:47:58,070 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.9s Time]
[2022-11-02 20:47:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states.
[2022-11-02 20:47:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584.
[2022-11-02 20:47:58,103 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-11-02 20:47:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2214 transitions.
[2022-11-02 20:47:58,109 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2214 transitions. Word has length 131
[2022-11-02 20:47:58,109 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:47:58,110 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2214 transitions.
[2022-11-02 20:47:58,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:47:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2214 transitions.
[2022-11-02 20:47:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2022-11-02 20:47:58,112 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:47:58,112 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:47:58,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:47:58,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:47:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:47:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 292340142, now seen corresponding path program 1 times
[2022-11-02 20:47:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:47:58,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145051453]
[2022-11-02 20:47:58,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:47:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:47:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:47:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:47:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:47:58,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145051453]
[2022-11-02 20:47:58,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145051453] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:47:58,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:47:58,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:47:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437366030]
[2022-11-02 20:47:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:47:58,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:47:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:47:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:47:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:47:58,415 INFO L87 Difference]: Start difference. First operand 1584 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:01,311 INFO L93 Difference]: Finished difference Result 4090 states and 5888 transitions.
[2022-11-02 20:48:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:48:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 135
[2022-11-02 20:48:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:01,321 INFO L225 Difference]: With dead ends: 4090
[2022-11-02 20:48:01,321 INFO L226 Difference]: Without dead ends: 2807
[2022-11-02 20:48:01,323 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-11-02 20:48:01,324 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 349 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:01,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 416 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2022-11-02 20:48:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states.
[2022-11-02 20:48:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2184.
[2022-11-02 20:48:01,367 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-11-02 20:48:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2904 transitions.
[2022-11-02 20:48:01,375 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2904 transitions. Word has length 135
[2022-11-02 20:48:01,375 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:01,375 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 2904 transitions.
[2022-11-02 20:48:01,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2904 transitions.
[2022-11-02 20:48:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2022-11-02 20:48:01,382 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:01,382 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, 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]
[2022-11-02 20:48:01,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:48:01,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1279382026, now seen corresponding path program 1 times
[2022-11-02 20:48:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:01,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843377206]
[2022-11-02 20:48:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2022-11-02 20:48:01,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:01,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843377206]
[2022-11-02 20:48:01,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843377206] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:01,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:01,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:48:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998858390]
[2022-11-02 20:48:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:01,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:01,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:01,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:01,838 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-11-02 20:48:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:04,190 INFO L93 Difference]: Finished difference Result 5868 states and 7890 transitions.
[2022-11-02 20:48:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:04,191 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 335
[2022-11-02 20:48:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:04,203 INFO L225 Difference]: With dead ends: 5868
[2022-11-02 20:48:04,203 INFO L226 Difference]: Without dead ends: 3686
[2022-11-02 20:48:04,206 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-11-02 20:48:04,207 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:04,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2022-11-02 20:48:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states.
[2022-11-02 20:48:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684.
[2022-11-02 20:48:04,269 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-11-02 20:48:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions.
[2022-11-02 20:48:04,277 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 335
[2022-11-02 20:48:04,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:04,279 INFO L495 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions.
[2022-11-02 20:48:04,279 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-11-02 20:48:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions.
[2022-11-02 20:48:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2022-11-02 20:48:04,287 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:04,287 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:48:04,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:48:04,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1245441651, now seen corresponding path program 1 times
[2022-11-02 20:48:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:04,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043514390]
[2022-11-02 20:48:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2022-11-02 20:48:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:05,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043514390]
[2022-11-02 20:48:05,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043514390] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:05,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:05,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:48:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971426385]
[2022-11-02 20:48:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:05,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:05,184 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-11-02 20:48:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:07,372 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions.
[2022-11-02 20:48:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:07,373 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 383
[2022-11-02 20:48:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:07,390 INFO L225 Difference]: With dead ends: 7665
[2022-11-02 20:48:07,390 INFO L226 Difference]: Without dead ends: 3983
[2022-11-02 20:48:07,395 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-11-02 20:48:07,396 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:07,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2022-11-02 20:48:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states.
[2022-11-02 20:48:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983.
[2022-11-02 20:48:07,470 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-11-02 20:48:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions.
[2022-11-02 20:48:07,479 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 383
[2022-11-02 20:48:07,479 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:07,479 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions.
[2022-11-02 20:48:07,480 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-11-02 20:48:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions.
[2022-11-02 20:48:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427
[2022-11-02 20:48:07,489 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:07,490 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:48:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 20:48:07,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 342717355, now seen corresponding path program 1 times
[2022-11-02 20:48:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:07,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351996613]
[2022-11-02 20:48:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2022-11-02 20:48:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351996613]
[2022-11-02 20:48:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351996613] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:07,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:07,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:07,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113387314]
[2022-11-02 20:48:07,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:07,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:07,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:07,896 INFO L87 Difference]: Start difference. First operand 3983 states and 4939 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:10,497 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions.
[2022-11-02 20:48:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 426
[2022-11-02 20:48:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:10,514 INFO L225 Difference]: With dead ends: 8861
[2022-11-02 20:48:10,514 INFO L226 Difference]: Without dead ends: 5179
[2022-11-02 20:48:10,518 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-11-02 20:48:10,519 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 249 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 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, 2.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:10,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2022-11-02 20:48:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states.
[2022-11-02 20:48:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381.
[2022-11-02 20:48:10,596 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-11-02 20:48:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions.
[2022-11-02 20:48:10,604 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 426
[2022-11-02 20:48:10,604 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:10,605 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions.
[2022-11-02 20:48:10,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions.
[2022-11-02 20:48:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431
[2022-11-02 20:48:10,615 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:10,616 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:48:10,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 20:48:10,617 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1686545730, now seen corresponding path program 1 times
[2022-11-02 20:48:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:10,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275820065]
[2022-11-02 20:48:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:48:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275820065]
[2022-11-02 20:48:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275820065] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:11,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-02 20:48:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742115265]
[2022-11-02 20:48:11,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:11,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-11-02 20:48:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-02 20:48:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-11-02 20:48:11,588 INFO L87 Difference]: Start difference. First operand 3381 states and 4269 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:14,813 INFO L93 Difference]: Finished difference Result 8301 states and 10750 transitions.
[2022-11-02 20:48:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:48:14,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 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 430
[2022-11-02 20:48:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:14,838 INFO L225 Difference]: With dead ends: 8301
[2022-11-02 20:48:14,838 INFO L226 Difference]: Without dead ends: 5221
[2022-11-02 20:48:14,842 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-11-02 20:48:14,843 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 353 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:14,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 716 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2022-11-02 20:48:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states.
[2022-11-02 20:48:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4880.
[2022-11-02 20:48:14,938 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-11-02 20:48:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 5884 transitions.
[2022-11-02 20:48:14,957 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 5884 transitions. Word has length 430
[2022-11-02 20:48:14,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:14,958 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 5884 transitions.
[2022-11-02 20:48:14,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 5884 transitions.
[2022-11-02 20:48:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443
[2022-11-02 20:48:14,963 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:14,964 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:48:14,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 20:48:14,967 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1041714720, now seen corresponding path program 1 times
[2022-11-02 20:48:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:14,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528442760]
[2022-11-02 20:48:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2022-11-02 20:48:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:15,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528442760]
[2022-11-02 20:48:15,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528442760] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:15,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:15,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771692795]
[2022-11-02 20:48:15,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:15,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:15,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:15,454 INFO L87 Difference]: Start difference. First operand 4880 states and 5884 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:17,312 INFO L93 Difference]: Finished difference Result 10956 states and 13581 transitions.
[2022-11-02 20:48:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:17,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 442
[2022-11-02 20:48:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:17,337 INFO L225 Difference]: With dead ends: 10956
[2022-11-02 20:48:17,337 INFO L226 Difference]: Without dead ends: 6377
[2022-11-02 20:48:17,342 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-11-02 20:48:17,342 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 263 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 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.8s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:17,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 618 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2022-11-02 20:48:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states.
[2022-11-02 20:48:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 6374.
[2022-11-02 20:48:17,468 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-11-02 20:48:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 7538 transitions.
[2022-11-02 20:48:17,487 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 7538 transitions. Word has length 442
[2022-11-02 20:48:17,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:17,488 INFO L495 AbstractCegarLoop]: Abstraction has 6374 states and 7538 transitions.
[2022-11-02 20:48:17,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 7538 transitions.
[2022-11-02 20:48:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540
[2022-11-02 20:48:17,495 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:17,496 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, 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, 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-11-02 20:48:17,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-02 20:48:17,496 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -255819651, now seen corresponding path program 1 times
[2022-11-02 20:48:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:17,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647858940]
[2022-11-02 20:48:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:17,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked.
[2022-11-02 20:48:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:17,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647858940]
[2022-11-02 20:48:17,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647858940] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:17,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:17,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108225510]
[2022-11-02 20:48:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:17,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:17,906 INFO L87 Difference]: Start difference. First operand 6374 states and 7538 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-11-02 20:48:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:20,359 INFO L93 Difference]: Finished difference Result 16633 states and 19881 transitions.
[2022-11-02 20:48:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:20,361 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 539
[2022-11-02 20:48:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:20,380 INFO L225 Difference]: With dead ends: 16633
[2022-11-02 20:48:20,380 INFO L226 Difference]: Without dead ends: 10560
[2022-11-02 20:48:20,386 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-11-02 20:48:20,387 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 275 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 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.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:20,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 263 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2022-11-02 20:48:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states.
[2022-11-02 20:48:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 8467.
[2022-11-02 20:48:20,529 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-11-02 20:48:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 9994 transitions.
[2022-11-02 20:48:20,543 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 9994 transitions. Word has length 539
[2022-11-02 20:48:20,544 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:20,544 INFO L495 AbstractCegarLoop]: Abstraction has 8467 states and 9994 transitions.
[2022-11-02 20:48:20,544 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-11-02 20:48:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 9994 transitions.
[2022-11-02 20:48:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557
[2022-11-02 20:48:20,551 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:20,552 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, 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, 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-11-02 20:48:20,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-11-02 20:48:20,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1309397632, now seen corresponding path program 1 times
[2022-11-02 20:48:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:20,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098799618]
[2022-11-02 20:48:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2022-11-02 20:48:21,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:21,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098799618]
[2022-11-02 20:48:21,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098799618] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:21,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:21,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:21,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670256928]
[2022-11-02 20:48:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:21,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:21,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:21,154 INFO L87 Difference]: Start difference. First operand 8467 states and 9994 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:24,228 INFO L93 Difference]: Finished difference Result 19936 states and 23667 transitions.
[2022-11-02 20:48:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:24,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-11-02 20:48:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:24,251 INFO L225 Difference]: With dead ends: 19936
[2022-11-02 20:48:24,251 INFO L226 Difference]: Without dead ends: 11770
[2022-11-02 20:48:24,258 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-11-02 20:48:24,259 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 243 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:24,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 619 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2022-11-02 20:48:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states.
[2022-11-02 20:48:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 11758.
[2022-11-02 20:48:24,437 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-11-02 20:48:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11758 states to 11758 states and 13669 transitions.
[2022-11-02 20:48:24,456 INFO L78 Accepts]: Start accepts. Automaton has 11758 states and 13669 transitions. Word has length 556
[2022-11-02 20:48:24,457 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:24,457 INFO L495 AbstractCegarLoop]: Abstraction has 11758 states and 13669 transitions.
[2022-11-02 20:48:24,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11758 states and 13669 transitions.
[2022-11-02 20:48:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567
[2022-11-02 20:48:24,469 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:24,472 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, 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, 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-11-02 20:48:24,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-11-02 20:48:24,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash -951322089, now seen corresponding path program 1 times
[2022-11-02 20:48:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:24,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4112982]
[2022-11-02 20:48:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2022-11-02 20:48:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:24,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4112982]
[2022-11-02 20:48:24,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4112982] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:24,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:24,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944473194]
[2022-11-02 20:48:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:24,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:24,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:24,915 INFO L87 Difference]: Start difference. First operand 11758 states and 13669 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:26,979 INFO L93 Difference]: Finished difference Result 23512 states and 27370 transitions.
[2022-11-02 20:48:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 566
[2022-11-02 20:48:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:27,001 INFO L225 Difference]: With dead ends: 23512
[2022-11-02 20:48:27,002 INFO L226 Difference]: Without dead ends: 12055
[2022-11-02 20:48:27,010 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-11-02 20:48:27,011 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.9s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:27,012 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.9s Time]
[2022-11-02 20:48:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states.
[2022-11-02 20:48:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 11756.
[2022-11-02 20:48:27,172 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-11-02 20:48:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11756 states to 11756 states and 13665 transitions.
[2022-11-02 20:48:27,190 INFO L78 Accepts]: Start accepts. Automaton has 11756 states and 13665 transitions. Word has length 566
[2022-11-02 20:48:27,191 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:27,191 INFO L495 AbstractCegarLoop]: Abstraction has 11756 states and 13665 transitions.
[2022-11-02 20:48:27,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 11756 states and 13665 transitions.
[2022-11-02 20:48:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587
[2022-11-02 20:48:27,200 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:27,201 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-11-02 20:48:27,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-11-02 20:48:27,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1512951466, now seen corresponding path program 1 times
[2022-11-02 20:48:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:27,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576666973]
[2022-11-02 20:48:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:27,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2022-11-02 20:48:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:27,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576666973]
[2022-11-02 20:48:27,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576666973] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:27,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:27,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135719422]
[2022-11-02 20:48:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:27,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:27,599 INFO L87 Difference]: Start difference. First operand 11756 states and 13665 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:29,291 INFO L93 Difference]: Finished difference Result 24706 states and 28704 transitions.
[2022-11-02 20:48:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 586
[2022-11-02 20:48:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:29,311 INFO L225 Difference]: With dead ends: 24706
[2022-11-02 20:48:29,312 INFO L226 Difference]: Without dead ends: 13251
[2022-11-02 20:48:29,320 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-11-02 20:48:29,321 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:29,321 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.5s Time]
[2022-11-02 20:48:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states.
[2022-11-02 20:48:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 9959.
[2022-11-02 20:48:29,467 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-11-02 20:48:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9959 states to 9959 states and 11729 transitions.
[2022-11-02 20:48:29,482 INFO L78 Accepts]: Start accepts. Automaton has 9959 states and 11729 transitions. Word has length 586
[2022-11-02 20:48:29,483 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:29,483 INFO L495 AbstractCegarLoop]: Abstraction has 9959 states and 11729 transitions.
[2022-11-02 20:48:29,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9959 states and 11729 transitions.
[2022-11-02 20:48:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593
[2022-11-02 20:48:29,494 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:29,494 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-02 20:48:29,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-11-02 20:48:29,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash 241840910, now seen corresponding path program 1 times
[2022-11-02 20:48:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:29,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737831503]
[2022-11-02 20:48:29,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2022-11-02 20:48:30,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:30,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737831503]
[2022-11-02 20:48:30,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737831503] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:30,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:30,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109417767]
[2022-11-02 20:48:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:30,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:30,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:30,176 INFO L87 Difference]: Start difference. First operand 9959 states and 11729 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:32,646 INFO L93 Difference]: Finished difference Result 25896 states and 30602 transitions.
[2022-11-02 20:48:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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 592
[2022-11-02 20:48:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:32,680 INFO L225 Difference]: With dead ends: 25896
[2022-11-02 20:48:32,680 INFO L226 Difference]: Without dead ends: 16238
[2022-11-02 20:48:32,691 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-11-02 20:48:32,692 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 221 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:32,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 206 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2022-11-02 20:48:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16238 states.
[2022-11-02 20:48:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16238 to 12052.
[2022-11-02 20:48:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12052 states, 12051 states have (on average 1.1993195585428595) internal successors, (14453), 12051 states have internal predecessors, (14453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12052 states to 12052 states and 14453 transitions.
[2022-11-02 20:48:32,919 INFO L78 Accepts]: Start accepts. Automaton has 12052 states and 14453 transitions. Word has length 592
[2022-11-02 20:48:32,919 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:32,920 INFO L495 AbstractCegarLoop]: Abstraction has 12052 states and 14453 transitions.
[2022-11-02 20:48:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 12052 states and 14453 transitions.
[2022-11-02 20:48:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630
[2022-11-02 20:48:32,930 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:32,931 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, 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, 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-11-02 20:48:32,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-11-02 20:48:32,931 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1941336849, now seen corresponding path program 1 times
[2022-11-02 20:48:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:32,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22049064]
[2022-11-02 20:48:32,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 619 proven. 39 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2022-11-02 20:48:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:33,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22049064]
[2022-11-02 20:48:33,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22049064] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:48:33,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924618748]
[2022-11-02 20:48:33,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:33,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:48:33,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:48:33,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:48:33,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-11-02 20:48:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:34,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:48:34,268 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:48:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked.
[2022-11-02 20:48:34,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:48:34,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924618748] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:34,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:48:34,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2022-11-02 20:48:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989399320]
[2022-11-02 20:48:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:34,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:34,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:48:34,458 INFO L87 Difference]: Start difference. First operand 12052 states and 14453 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:37,014 INFO L93 Difference]: Finished difference Result 26794 states and 32889 transitions.
[2022-11-02 20:48:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:37,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 629
[2022-11-02 20:48:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:37,036 INFO L225 Difference]: With dead ends: 26794
[2022-11-02 20:48:37,037 INFO L226 Difference]: Without dead ends: 15043
[2022-11-02 20:48:37,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 628 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-11-02 20:48:37,045 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 259 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 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, 2.4s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:37,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 626 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2022-11-02 20:48:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15043 states.
[2022-11-02 20:48:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15043 to 14445.
[2022-11-02 20:48:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14445 states, 14444 states have (on average 1.1806978676266962) internal successors, (17054), 14444 states have internal predecessors, (17054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14445 states to 14445 states and 17054 transitions.
[2022-11-02 20:48:37,264 INFO L78 Accepts]: Start accepts. Automaton has 14445 states and 17054 transitions. Word has length 629
[2022-11-02 20:48:37,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:37,265 INFO L495 AbstractCegarLoop]: Abstraction has 14445 states and 17054 transitions.
[2022-11-02 20:48:37,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14445 states and 17054 transitions.
[2022-11-02 20:48:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687
[2022-11-02 20:48:37,278 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:37,279 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-11-02 20:48:37,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-11-02 20:48:37,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2022-11-02 20:48:37,493 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -599106639, now seen corresponding path program 1 times
[2022-11-02 20:48:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:37,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200631144]
[2022-11-02 20:48:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2022-11-02 20:48:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:38,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200631144]
[2022-11-02 20:48:38,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200631144] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:48:38,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793964041]
[2022-11-02 20:48:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:38,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:48:38,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:48:38,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:48:38,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-11-02 20:48:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:38,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-11-02 20:48:38,803 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:48:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2022-11-02 20:48:39,745 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:48:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2022-11-02 20:48:40,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793964041] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:48:40,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-11-02 20:48:40,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2022-11-02 20:48:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704431213]
[2022-11-02 20:48:40,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:48:40,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-11-02 20:48:40,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-11-02 20:48:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2022-11-02 20:48:40,745 INFO L87 Difference]: Start difference. First operand 14445 states and 17054 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-11-02 20:48:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:49,250 INFO L93 Difference]: Finished difference Result 36221 states and 42293 transitions.
[2022-11-02 20:48:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-11-02 20:48:49,251 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 686
[2022-11-02 20:48:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:49,278 INFO L225 Difference]: With dead ends: 36221
[2022-11-02 20:48:49,278 INFO L226 Difference]: Without dead ends: 16838
[2022-11-02 20:48:49,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1366 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-11-02 20:48:49,289 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2854 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5828 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2854 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 6455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 5828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:49,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2854 Valid, 233 Invalid, 6455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 5828 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time]
[2022-11-02 20:48:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16838 states.
[2022-11-02 20:48:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16838 to 16835.
[2022-11-02 20:48:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16835 states, 16834 states have (on average 1.0624925745515028) internal successors, (17886), 16834 states have internal predecessors, (17886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16835 states to 16835 states and 17886 transitions.
[2022-11-02 20:48:49,670 INFO L78 Accepts]: Start accepts. Automaton has 16835 states and 17886 transitions. Word has length 686
[2022-11-02 20:48:49,671 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:49,671 INFO L495 AbstractCegarLoop]: Abstraction has 16835 states and 17886 transitions.
[2022-11-02 20:48:49,672 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-11-02 20:48:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 16835 states and 17886 transitions.
[2022-11-02 20:48:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687
[2022-11-02 20:48:49,690 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:49,691 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, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:48:49,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-11-02 20:48:49,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-11-02 20:48:49,917 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 410633746, now seen corresponding path program 1 times
[2022-11-02 20:48:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:49,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832000437]
[2022-11-02 20:48:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2022-11-02 20:48:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:50,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832000437]
[2022-11-02 20:48:50,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832000437] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:50,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:50,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:48:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803986347]
[2022-11-02 20:48:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:50,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:48:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:48:50,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:48:50,633 INFO L87 Difference]: Start difference. First operand 16835 states and 17886 transitions. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:53,044 INFO L93 Difference]: Finished difference Result 35470 states and 37631 transitions.
[2022-11-02 20:48:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-11-02 20:48:53,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 686
[2022-11-02 20:48:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:53,063 INFO L225 Difference]: With dead ends: 35470
[2022-11-02 20:48:53,063 INFO L226 Difference]: Without dead ends: 18936
[2022-11-02 20:48:53,074 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-11-02 20:48:53,075 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 582 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:53,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 426 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2022-11-02 20:48:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18936 states.
[2022-11-02 20:48:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18936 to 18932.
[2022-11-02 20:48:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18932 states, 18931 states have (on average 1.0450583698695262) internal successors, (19784), 18931 states have internal predecessors, (19784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18932 states to 18932 states and 19784 transitions.
[2022-11-02 20:48:53,442 INFO L78 Accepts]: Start accepts. Automaton has 18932 states and 19784 transitions. Word has length 686
[2022-11-02 20:48:53,443 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:53,443 INFO L495 AbstractCegarLoop]: Abstraction has 18932 states and 19784 transitions.
[2022-11-02 20:48:53,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 18932 states and 19784 transitions.
[2022-11-02 20:48:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727
[2022-11-02 20:48:53,457 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:53,458 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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]
[2022-11-02 20:48:53,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-02 20:48:53,458 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash 908850648, now seen corresponding path program 1 times
[2022-11-02 20:48:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337768037]
[2022-11-02 20:48:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked.
[2022-11-02 20:48:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:54,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337768037]
[2022-11-02 20:48:54,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337768037] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:48:54,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:48:54,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:48:54,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347001834]
[2022-11-02 20:48:54,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:48:54,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:48:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:48:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:48:54,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:48:54,369 INFO L87 Difference]: Start difference. First operand 18932 states and 19784 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:48:55,939 INFO L93 Difference]: Finished difference Result 40566 states and 42406 transitions.
[2022-11-02 20:48:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:48:55,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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 726
[2022-11-02 20:48:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:48:55,967 INFO L225 Difference]: With dead ends: 40566
[2022-11-02 20:48:55,967 INFO L226 Difference]: Without dead ends: 21935
[2022-11-02 20:48:55,979 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-11-02 20:48:55,980 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 345 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2022-11-02 20:48:55,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 120 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-11-02 20:48:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states.
[2022-11-02 20:48:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 20426.
[2022-11-02 20:48:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20426 states, 20425 states have (on average 1.042252141982864) internal successors, (21288), 20425 states have internal predecessors, (21288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20426 states to 20426 states and 21288 transitions.
[2022-11-02 20:48:56,330 INFO L78 Accepts]: Start accepts. Automaton has 20426 states and 21288 transitions. Word has length 726
[2022-11-02 20:48:56,330 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:48:56,331 INFO L495 AbstractCegarLoop]: Abstraction has 20426 states and 21288 transitions.
[2022-11-02 20:48:56,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:48:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20426 states and 21288 transitions.
[2022-11-02 20:48:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757
[2022-11-02 20:48:56,340 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:48:56,341 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-02 20:48:56,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-11-02 20:48:56,341 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:48:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:48:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -586254201, now seen corresponding path program 1 times
[2022-11-02 20:48:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:48:56,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991716837]
[2022-11-02 20:48:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:48:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 583 proven. 188 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked.
[2022-11-02 20:48:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:48:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991716837]
[2022-11-02 20:48:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991716837] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:48:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330053620]
[2022-11-02 20:48:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:48:58,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:48:58,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:48:58,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:48:58,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-11-02 20:48:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:48:58,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:48:58,367 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:49:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked.
[2022-11-02 20:49:00,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:49:00,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330053620] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:49:00,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:49:00,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2022-11-02 20:49:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279216912]
[2022-11-02 20:49:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:49:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:49:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:49:00,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:49:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:49:00,327 INFO L87 Difference]: Start difference. First operand 20426 states and 21288 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:49:00,446 INFO L93 Difference]: Finished difference Result 20430 states and 21292 transitions.
[2022-11-02 20:49:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:49:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 756
[2022-11-02 20:49:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:49:00,529 INFO L225 Difference]: With dead ends: 20430
[2022-11-02 20:49:00,529 INFO L226 Difference]: Without dead ends: 20428
[2022-11-02 20:49:00,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:49:00,533 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 239 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:49:00,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 522 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 772 Unchecked, 0.0s Time]
[2022-11-02 20:49:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20428 states.
[2022-11-02 20:49:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20428 to 20127.
[2022-11-02 20:49:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20127 states, 20126 states have (on average 1.0420351783762298) internal successors, (20972), 20126 states have internal predecessors, (20972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20127 states to 20127 states and 20972 transitions.
[2022-11-02 20:49:00,865 INFO L78 Accepts]: Start accepts. Automaton has 20127 states and 20972 transitions. Word has length 756
[2022-11-02 20:49:00,866 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:49:00,866 INFO L495 AbstractCegarLoop]: Abstraction has 20127 states and 20972 transitions.
[2022-11-02 20:49:00,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 20127 states and 20972 transitions.
[2022-11-02 20:49:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800
[2022-11-02 20:49:00,892 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:00,893 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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]
[2022-11-02 20:49:00,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-11-02 20:49:01,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:49:01,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -577399626, now seen corresponding path program 1 times
[2022-11-02 20:49:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:49:01,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058698252]
[2022-11-02 20:49:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:49:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:49:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 464 proven. 364 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-11-02 20:49:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:49:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058698252]
[2022-11-02 20:49:02,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058698252] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:49:02,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520127447]
[2022-11-02 20:49:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:49:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:49:02,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:49:03,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-11-02 20:49:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:49:03,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-11-02 20:49:03,406 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:49:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2022-11-02 20:49:03,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-11-02 20:49:03,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520127447] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:49:03,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-11-02 20:49:03,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2022-11-02 20:49:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598235376]
[2022-11-02 20:49:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:49:03,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:49:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:49:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:49:03,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:49:03,950 INFO L87 Difference]: Start difference. First operand 20127 states and 20972 transitions. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:49:05,448 INFO L93 Difference]: Finished difference Result 39951 states and 41638 transitions.
[2022-11-02 20:49:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:49:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 799
[2022-11-02 20:49:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:49:05,466 INFO L225 Difference]: With dead ends: 39951
[2022-11-02 20:49:05,466 INFO L226 Difference]: Without dead ends: 20125
[2022-11-02 20:49:05,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-11-02 20:49:05,478 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 72 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-11-02 20:49:05,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 463 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-11-02 20:49:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20125 states.
[2022-11-02 20:49:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20125 to 19826.
[2022-11-02 20:49:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19826 states, 19825 states have (on average 1.0302143757881463) internal successors, (20424), 19825 states have internal predecessors, (20424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 20424 transitions.
[2022-11-02 20:49:05,710 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 20424 transitions. Word has length 799
[2022-11-02 20:49:05,710 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:49:05,710 INFO L495 AbstractCegarLoop]: Abstraction has 19826 states and 20424 transitions.
[2022-11-02 20:49:05,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 20424 transitions.
[2022-11-02 20:49:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814
[2022-11-02 20:49:05,723 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:05,723 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-02 20:49:05,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-11-02 20:49:05,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:49:05,925 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -176504871, now seen corresponding path program 1 times
[2022-11-02 20:49:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:49:05,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966083972]
[2022-11-02 20:49:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:49:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:49:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 714 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked.
[2022-11-02 20:49:06,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:49:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966083972]
[2022-11-02 20:49:06,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966083972] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:49:06,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:49:06,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:49:06,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362545432]
[2022-11-02 20:49:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:49:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:49:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:49:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:49:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:49:06,608 INFO L87 Difference]: Start difference. First operand 19826 states and 20424 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:49:07,823 INFO L93 Difference]: Finished difference Result 33324 states and 34279 transitions.
[2022-11-02 20:49:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:49:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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 813
[2022-11-02 20:49:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:49:07,836 INFO L225 Difference]: With dead ends: 33324
[2022-11-02 20:49:07,836 INFO L226 Difference]: Without dead ends: 13799
[2022-11-02 20:49:07,843 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-11-02 20:49:07,844 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 223 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-11-02 20:49:07,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 357 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-11-02 20:49:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states.
[2022-11-02 20:49:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11403.
[2022-11-02 20:49:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11403 states, 11402 states have (on average 1.0253464304507982) internal successors, (11691), 11402 states have internal predecessors, (11691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11403 states to 11403 states and 11691 transitions.
[2022-11-02 20:49:07,975 INFO L78 Accepts]: Start accepts. Automaton has 11403 states and 11691 transitions. Word has length 813
[2022-11-02 20:49:07,976 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:49:07,976 INFO L495 AbstractCegarLoop]: Abstraction has 11403 states and 11691 transitions.
[2022-11-02 20:49:07,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11403 states and 11691 transitions.
[2022-11-02 20:49:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842
[2022-11-02 20:49:07,985 INFO L187 NwaCegarLoop]: Found error trace
[2022-11-02 20:49:07,985 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:49:07,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-11-02 20:49:07,985 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-02 20:49:07,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:49:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1105125242, now seen corresponding path program 1 times
[2022-11-02 20:49:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:49:07,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252416081]
[2022-11-02 20:49:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:49:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:49:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:49:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked.
[2022-11-02 20:49:08,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:49:08,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252416081]
[2022-11-02 20:49:08,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252416081] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:49:08,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:49:08,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:49:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724688699]
[2022-11-02 20:49:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:49:08,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:49:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:49:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:49:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:49:08,406 INFO L87 Difference]: Start difference. First operand 11403 states and 11691 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-02 20:49:09,566 INFO L93 Difference]: Finished difference Result 22501 states and 23072 transitions.
[2022-11-02 20:49:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:49:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 841
[2022-11-02 20:49:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-02 20:49:09,568 INFO L225 Difference]: With dead ends: 22501
[2022-11-02 20:49:09,568 INFO L226 Difference]: Without dead ends: 0
[2022-11-02 20:49:09,573 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-11-02 20:49:09,574 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 323 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-11-02 20:49:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 393 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-11-02 20:49:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-11-02 20:49:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-11-02 20:49:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-11-02 20:49:09,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 841
[2022-11-02 20:49:09,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-11-02 20:49:09,576 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-11-02 20:49:09,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:49:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-11-02 20:49:09,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-11-02 20:49:09,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-11-02 20:49:09,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-11-02 20:49:09,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-11-02 20:49:21,544 INFO L899 garLoopResultBuilder]: For program point L630(lines 630 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,544 INFO L899 garLoopResultBuilder]: For program point L1423(lines 1423 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,544 INFO L899 garLoopResultBuilder]: For program point L895(lines 895 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,544 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,544 INFO L899 garLoopResultBuilder]: For program point L1160(lines 1160 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,545 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,545 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 904) no Hoare annotation was computed.
[2022-11-02 20:49:21,545 INFO L899 garLoopResultBuilder]: For program point L896-2(lines 896 904) no Hoare annotation was computed.
[2022-11-02 20:49:21,545 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,545 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,545 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,546 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed.
[2022-11-02 20:49:21,546 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1029 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,546 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,546 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,546 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,546 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L1429(lines 1429 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L1430(lines 1430 1440) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L1430-2(lines 1430 1440) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L1166(lines 1166 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,547 INFO L899 garLoopResultBuilder]: For program point L1695(lines 1695 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,548 INFO L899 garLoopResultBuilder]: For program point L1299(lines 1299 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,548 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed.
[2022-11-02 20:49:21,548 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,548 INFO L899 garLoopResultBuilder]: For program point L1696(lines 1696 1703) no Hoare annotation was computed.
[2022-11-02 20:49:21,548 INFO L899 garLoopResultBuilder]: For program point L1696-2(lines 1696 1703) no Hoare annotation was computed.
[2022-11-02 20:49:21,548 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L1300(lines 1300 1309) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L1300-2(lines 1300 1309) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1036 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,549 INFO L899 garLoopResultBuilder]: For program point L905(lines 905 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,550 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,550 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed.
[2022-11-02 20:49:21,550 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,550 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,550 INFO L899 garLoopResultBuilder]: For program point L1040(lines 1040 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,550 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,551 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,551 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,551 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed.
[2022-11-02 20:49:21,551 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,551 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,551 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,552 INFO L899 garLoopResultBuilder]: For program point L1704(lines 1704 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,552 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,552 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,552 INFO L899 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed.
[2022-11-02 20:49:21,552 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,552 INFO L899 garLoopResultBuilder]: For program point L1045(lines 1045 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,553 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,553 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,553 INFO L899 garLoopResultBuilder]: For program point L1178(lines 1178 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,553 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,553 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed.
[2022-11-02 20:49:21,553 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,554 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,554 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,554 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,554 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 661) no Hoare annotation was computed.
[2022-11-02 20:49:21,554 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 661) no Hoare annotation was computed.
[2022-11-02 20:49:21,554 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,555 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,555 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,555 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,555 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed.
[2022-11-02 20:49:21,555 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,555 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,556 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,556 INFO L899 garLoopResultBuilder]: For program point L1448(lines 1448 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,556 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,556 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,556 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1591) no Hoare annotation was computed.
[2022-11-02 20:49:21,556 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,557 INFO L899 garLoopResultBuilder]: For program point L1581-2(lines 1581 1591) no Hoare annotation was computed.
[2022-11-02 20:49:21,557 INFO L899 garLoopResultBuilder]: For program point L1449(lines 1449 1458) no Hoare annotation was computed.
[2022-11-02 20:49:21,557 INFO L899 garLoopResultBuilder]: For program point L1449-2(lines 1449 1458) no Hoare annotation was computed.
[2022-11-02 20:49:21,557 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed.
[2022-11-02 20:49:21,557 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,557 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,558 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,558 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,558 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,558 INFO L899 garLoopResultBuilder]: For program point L1716(lines 1716 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,558 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,558 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,559 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed.
[2022-11-02 20:49:21,559 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed.
[2022-11-02 20:49:21,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed.
[2022-11-02 20:49:21,559 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,559 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,560 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,560 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,560 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,560 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed.
[2022-11-02 20:49:21,560 INFO L899 garLoopResultBuilder]: For program point L1059(lines 1059 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,560 INFO L899 garLoopResultBuilder]: For program point L1720(lines 1720 1731) no Hoare annotation was computed.
[2022-11-02 20:49:21,561 INFO L899 garLoopResultBuilder]: For program point L1720-2(lines 1720 1731) no Hoare annotation was computed.
[2022-11-02 20:49:21,561 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 538) no Hoare annotation was computed.
[2022-11-02 20:49:21,561 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 538) no Hoare annotation was computed.
[2022-11-02 20:49:21,561 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1071) no Hoare annotation was computed.
[2022-11-02 20:49:21,561 INFO L899 garLoopResultBuilder]: For program point L1060-2(lines 1060 1071) no Hoare annotation was computed.
[2022-11-02 20:49:21,561 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,562 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,562 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,562 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,562 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 412) no Hoare annotation was computed.
[2022-11-02 20:49:21,562 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 401 412) no Hoare annotation was computed.
[2022-11-02 20:49:21,562 INFO L899 garLoopResultBuilder]: For program point L1194(lines 1194 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,563 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed.
[2022-11-02 20:49:21,563 INFO L899 garLoopResultBuilder]: For program point L1459(lines 1459 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,563 INFO L899 garLoopResultBuilder]: For program point L1327(lines 1327 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,563 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,563 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,563 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,564 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,564 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed.
[2022-11-02 20:49:21,564 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,564 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,565 INFO L899 garLoopResultBuilder]: For program point L935(lines 935 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,565 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,565 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,565 INFO L899 garLoopResultBuilder]: For program point L1332(lines 1332 1342) no Hoare annotation was computed.
[2022-11-02 20:49:21,565 INFO L899 garLoopResultBuilder]: For program point L1332-2(lines 1332 1342) no Hoare annotation was computed.
[2022-11-02 20:49:21,565 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,566 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed.
[2022-11-02 20:49:21,566 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 813) no Hoare annotation was computed.
[2022-11-02 20:49:21,566 INFO L899 garLoopResultBuilder]: For program point L804-2(lines 804 813) no Hoare annotation was computed.
[2022-11-02 20:49:21,566 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,566 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 551) no Hoare annotation was computed.
[2022-11-02 20:49:21,566 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 540 551) no Hoare annotation was computed.
[2022-11-02 20:49:21,567 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,567 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,567 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,567 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,567 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed.
[2022-11-02 20:49:21,567 INFO L899 garLoopResultBuilder]: For program point L1732(lines 1732 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,568 INFO L899 garLoopResultBuilder]: For program point L1072(lines 1072 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,568 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,568 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,568 INFO L899 garLoopResultBuilder]: For program point L1073(lines 1073 1083) no Hoare annotation was computed.
[2022-11-02 20:49:21,568 INFO L899 garLoopResultBuilder]: For program point L1073-2(lines 1073 1083) no Hoare annotation was computed.
[2022-11-02 20:49:21,568 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,569 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed.
[2022-11-02 20:49:21,569 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,569 INFO L899 garLoopResultBuilder]: For program point L1471(lines 1471 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,569 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,569 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,569 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,570 INFO L899 garLoopResultBuilder]: For program point L1605(lines 1605 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,570 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed.
[2022-11-02 20:49:21,570 INFO L899 garLoopResultBuilder]: For program point L945(lines 945 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,570 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,570 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,570 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,571 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,571 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,571 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,571 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed.
[2022-11-02 20:49:21,571 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,571 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,572 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,572 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,572 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,572 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed.
[2022-11-02 20:49:21,572 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,572 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,573 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,573 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,573 INFO L899 garLoopResultBuilder]: For program point L1745(lines 1745 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,573 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,573 INFO L899 garLoopResultBuilder]: For program point L160-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2022-11-02 20:49:21,574 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,574 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 566) no Hoare annotation was computed.
[2022-11-02 20:49:21,574 INFO L899 garLoopResultBuilder]: For program point L557-2(lines 557 566) no Hoare annotation was computed.
[2022-11-02 20:49:21,574 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,574 INFO L899 garLoopResultBuilder]: For program point L1218(lines 1218 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,574 INFO L899 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L1483(lines 1483 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,575 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,576 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,576 INFO L899 garLoopResultBuilder]: For program point L1091(lines 1091 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,576 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed.
[2022-11-02 20:49:21,576 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,576 INFO L899 garLoopResultBuilder]: For program point L827(lines 827 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,576 INFO L899 garLoopResultBuilder]: For program point L1752(lines 1752 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,577 INFO L899 garLoopResultBuilder]: For program point L1488(lines 1488 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,577 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed.
[2022-11-02 20:49:21,577 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed.
[2022-11-02 20:49:21,577 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,577 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,577 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,578 INFO L899 garLoopResultBuilder]: For program point L169-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,578 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,578 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1632) no Hoare annotation was computed.
[2022-11-02 20:49:21,578 INFO L899 garLoopResultBuilder]: For program point L1623-2(lines 1623 1632) no Hoare annotation was computed.
[2022-11-02 20:49:21,578 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,578 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L1492(lines 1492 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,579 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 578) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L568-2(lines 568 578) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L1361(lines 1361 1368) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L1361-2(lines 1361 1368) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L1759(lines 1759 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,580 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L175-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 716) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L704-2(lines 704 716) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L969(lines 969 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L1498(lines 1498 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,581 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,582 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,582 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,582 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,582 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,582 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,582 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed.
[2022-11-02 20:49:21,583 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed.
[2022-11-02 20:49:21,583 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 849) no Hoare annotation was computed.
[2022-11-02 20:49:21,583 INFO L899 garLoopResultBuilder]: For program point L840-2(lines 840 849) no Hoare annotation was computed.
[2022-11-02 20:49:21,583 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,583 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,583 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,584 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,584 INFO L895 garLoopResultBuilder]: At program point L1767(lines 1668 1768) the Hoare annotation is: (let ((.cse14 (<= (+ 89 ~a4~0) 0)) (.cse7 (<= 0 (+ ~a29~0 127))) (.cse19 (<= 0 (+ ~a0~0 60))) (.cse8 (<= (+ ~a4~0 86) 0)) (.cse1 (<= (+ 98 ~a0~0) 0))) (let ((.cse3 (<= (+ ~a0~0 147) 0)) (.cse9 (= ~a2~0 1)) (.cse6 (<= ~a29~0 43)) (.cse11 (<= 44 ~a29~0)) (.cse4 (<= 4 ~a2~0)) (.cse17 (not .cse1)) (.cse2 (= 3 ~a2~0)) (.cse10 (= 2 ~a2~0)) (.cse5 (or (and .cse7 .cse14) (and .cse7 .cse19 .cse8))) (.cse13 (<= (+ ~a0~0 61) 0)) (.cse18 (<= (+ 104 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse12 (<= 5 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse4 .cse6) (and .cse7 .cse8 .cse2) (and .cse0 .cse7 .cse9 .cse6) (and .cse10 .cse11 .cse1) (and .cse0 .cse10 .cse3) (and .cse5 .cse12) (and .cse0 .cse9 .cse6 .cse13) (and .cse9 .cse8 .cse13) (and .cse10 .cse14) (and .cse0 .cse1 .cse9) (and (or (and .cse14 .cse6 (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse15 (mod (+ (div .cse16 10) 1) 63))) (and (<= .cse15 (+ ~a29~0 143)) (not (= (mod .cse16 10) 0)) (not (= .cse15 0)) (< .cse16 0)))))) (and .cse14 .cse17 .cse6)) .cse4) (and .cse0 .cse7 .cse1 .cse12) (and .cse18 .cse0 .cse11 .cse4) (and .cse14 .cse17 .cse13) (and .cse14 .cse2) (and .cse0 .cse10 .cse7 .cse1) (and .cse10 .cse19 .cse8) (and .cse5 .cse13) (and .cse14 .cse12) (and .cse18 .cse0 .cse12))))
[2022-11-02 20:49:21,584 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed.
[2022-11-02 20:49:21,585 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed.
[2022-11-02 20:49:21,585 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,585 INFO L899 garLoopResultBuilder]: For program point L1504(lines 1504 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,585 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,585 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,585 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,586 INFO L899 garLoopResultBuilder]: For program point L1241(lines 1241 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,586 INFO L899 garLoopResultBuilder]: For program point L184-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,586 INFO L899 garLoopResultBuilder]: For program point L1109(lines 1109 1117) no Hoare annotation was computed.
[2022-11-02 20:49:21,586 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,586 INFO L899 garLoopResultBuilder]: For program point L1109-2(lines 1109 1117) no Hoare annotation was computed.
[2022-11-02 20:49:21,586 INFO L902 garLoopResultBuilder]: At program point L1770(lines 1770 1786) the Hoare annotation is: true
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 329) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L317-2(lines 317 329) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L1375(lines 1375 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,587 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 596) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 596) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L850(lines 850 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,588 INFO L899 garLoopResultBuilder]: For program point L1511(lines 1511 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2022-11-02 20:49:21,589 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,589 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,589 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,589 INFO L899 garLoopResultBuilder]: For program point L983(lines 983 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,590 INFO L895 garLoopResultBuilder]: At program point L1776-2(lines 1776 1785) the Hoare annotation is: (let ((.cse1 (<= (+ 98 ~a0~0) 0)) (.cse19 (<= 0 (+ ~a0~0 60))) (.cse6 (<= (+ ~a4~0 86) 0)) (.cse5 (<= 0 (+ ~a29~0 127))) (.cse13 (<= (+ 89 ~a4~0) 0))) (let ((.cse3 (<= (+ ~a0~0 147) 0)) (.cse10 (<= 44 ~a29~0)) (.cse7 (= ~a2~0 1)) (.cse4 (<= 4 ~a2~0)) (.cse11 (or (and .cse5 .cse19 .cse6) (and .cse5 .cse13 (or (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) (not (= |ULTIMATE.start_calculate_output_~input#1| ~a2~0)))))) (.cse8 (<= ~a29~0 43)) (.cse17 (not .cse1)) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse2 (= 3 ~a2~0)) (.cse9 (= 2 ~a2~0)) (.cse18 (<= (+ 104 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse14 (<= 5 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse2) (and .cse0 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse1) (and .cse11 .cse12) (and .cse0 .cse9 .cse3) (and .cse5 .cse7 .cse6 .cse12) (and .cse0 .cse7 .cse8 .cse12) (and .cse9 .cse13) (and .cse0 .cse1 .cse7) (and .cse14 .cse11) (and (or (and .cse13 .cse8 (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse15 (mod (+ (div .cse16 10) 1) 63))) (and (<= .cse15 (+ ~a29~0 143)) (not (= (mod .cse16 10) 0)) (not (= .cse15 0)) (< .cse16 0)))))) (and .cse13 .cse17 .cse8)) .cse4) (and .cse0 .cse5 .cse1 .cse14) (and .cse18 .cse0 .cse10 .cse4) (and .cse7 .cse6 (<= (+ ~a29~0 144) 0)) (and .cse4 .cse11 .cse8) (and .cse13 .cse17 .cse12) (and .cse13 .cse2) (and .cse0 .cse9 .cse5 .cse1) (and .cse9 .cse19 .cse6) (and .cse13 .cse14) (and .cse18 .cse0 .cse14))))
[2022-11-02 20:49:21,590 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,590 INFO L899 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed.
[2022-11-02 20:49:21,590 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L1381(lines 1381 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L193-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L1118(lines 1118 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,591 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed.
[2022-11-02 20:49:21,592 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed.
[2022-11-02 20:49:21,592 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,592 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,592 INFO L899 garLoopResultBuilder]: For program point L1781(line 1781) no Hoare annotation was computed.
[2022-11-02 20:49:21,592 INFO L899 garLoopResultBuilder]: For program point L1253(lines 1253 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,592 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,593 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,593 INFO L899 garLoopResultBuilder]: For program point L989(lines 989 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,593 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,593 INFO L899 garLoopResultBuilder]: For program point L1518(lines 1518 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,593 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed.
[2022-11-02 20:49:21,593 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed.
[2022-11-02 20:49:21,594 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,594 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,594 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,594 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,594 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,594 INFO L899 garLoopResultBuilder]: For program point L1521(lines 1521 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1125 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,595 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,596 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,596 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,596 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,596 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed.
[2022-11-02 20:49:21,596 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed.
[2022-11-02 20:49:21,596 INFO L899 garLoopResultBuilder]: For program point L1657(lines 1657 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,597 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,597 INFO L899 garLoopResultBuilder]: For program point L1526(lines 1526 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,597 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,597 INFO L899 garLoopResultBuilder]: For program point L205-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,597 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,597 INFO L899 garLoopResultBuilder]: For program point L1395(lines 1395 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L1132(lines 1132 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,598 INFO L899 garLoopResultBuilder]: For program point L1265(lines 1265 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,599 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,599 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,599 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 615) no Hoare annotation was computed.
[2022-11-02 20:49:21,599 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 615) no Hoare annotation was computed.
[2022-11-02 20:49:21,599 INFO L899 garLoopResultBuilder]: For program point L1398(lines 1398 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,599 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1002 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,600 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,601 INFO L895 garLoopResultBuilder]: At program point L1665(lines 33 1666) the Hoare annotation is: (let ((.cse1 (<= (+ 98 ~a0~0) 0)) (.cse19 (<= 0 (+ ~a0~0 60))) (.cse6 (<= (+ ~a4~0 86) 0)) (.cse5 (<= 0 (+ ~a29~0 127))) (.cse13 (<= (+ 89 ~a4~0) 0))) (let ((.cse3 (<= (+ ~a0~0 147) 0)) (.cse10 (<= 44 ~a29~0)) (.cse7 (= ~a2~0 1)) (.cse4 (<= 4 ~a2~0)) (.cse11 (or (and .cse5 .cse19 .cse6) (and .cse5 .cse13 (or (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) (not (= |ULTIMATE.start_calculate_output_~input#1| ~a2~0)))))) (.cse8 (<= ~a29~0 43)) (.cse17 (not .cse1)) (.cse12 (<= (+ ~a0~0 61) 0)) (.cse2 (= 3 ~a2~0)) (.cse9 (= 2 ~a2~0)) (.cse18 (<= (+ 104 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse14 (<= 5 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse2) (and .cse0 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse1) (and .cse11 .cse12) (and .cse0 .cse9 .cse3) (and .cse5 .cse7 .cse6 .cse12) (and .cse0 .cse7 .cse8 .cse12) (and .cse9 .cse13) (and .cse0 .cse1 .cse7) (and .cse14 .cse11) (and (or (and .cse13 .cse8 (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse15 (mod (+ (div .cse16 10) 1) 63))) (and (<= .cse15 (+ ~a29~0 143)) (not (= (mod .cse16 10) 0)) (not (= .cse15 0)) (< .cse16 0)))))) (and .cse13 .cse17 .cse8)) .cse4) (and .cse0 .cse5 .cse1 .cse14) (and .cse18 .cse0 .cse10 .cse4) (and .cse7 .cse6 (<= (+ ~a29~0 144) 0)) (and .cse4 .cse11 .cse8) (and .cse13 .cse17 .cse12) (and .cse13 .cse2) (and .cse0 .cse9 .cse5 .cse1) (and .cse9 .cse19 .cse6) (and .cse13 .cse14) (and .cse18 .cse0 .cse14))))
[2022-11-02 20:49:21,601 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed.
[2022-11-02 20:49:21,601 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed.
[2022-11-02 20:49:21,601 INFO L899 garLoopResultBuilder]: For program point L1138(lines 1138 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,602 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,602 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,602 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,602 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,602 INFO L899 garLoopResultBuilder]: For program point L214-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,602 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,603 INFO L899 garLoopResultBuilder]: For program point L1404(lines 1404 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,603 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed.
[2022-11-02 20:49:21,603 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed.
[2022-11-02 20:49:21,603 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,603 INFO L899 garLoopResultBuilder]: For program point L1405(lines 1405 1417) no Hoare annotation was computed.
[2022-11-02 20:49:21,603 INFO L899 garLoopResultBuilder]: For program point L1405-2(lines 1405 1417) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point L1538(lines 1538 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point L1671(lines 1671 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,604 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed.
[2022-11-02 20:49:21,605 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed.
[2022-11-02 20:49:21,605 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,605 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,605 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,605 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,605 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 359) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 359) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L1145(lines 1145 1154) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L1145-2(lines 1145 1154) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,606 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,607 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,607 INFO L899 garLoopResultBuilder]: For program point L884(lines 884 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,607 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,607 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,607 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,607 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed.
[2022-11-02 20:49:21,608 INFO L899 garLoopResultBuilder]: For program point L1678(lines 1678 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,608 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,608 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,608 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,608 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed.
[2022-11-02 20:49:21,608 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1766) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,609 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L758(lines 758 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L1287(lines 1287 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 238) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L230-2(lines 230 238) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed.
[2022-11-02 20:49:21,610 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,611 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 33 1666) no Hoare annotation was computed.
[2022-11-02 20:49:21,611 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,611 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed.
[2022-11-02 20:49:21,611 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1664) no Hoare annotation was computed.
[2022-11-02 20:49:21,615 INFO L444 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]
[2022-11-02 20:49:21,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:49:21,630 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,631 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,631 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:49:21 BoogieIcfgContainer
[2022-11-02 20:49:21,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:49:21,675 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:49:21,675 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:49:21,675 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:49:21,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:48" (3/4) ...
[2022-11-02 20:49:21,692 INFO L137 WitnessPrinter]: Generating witness for correct program
[2022-11-02 20:49:21,729 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2022-11-02 20:49:21,732 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2022-11-02 20:49:21,734 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2022-11-02 20:49:21,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2022-11-02 20:49:21,768 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((42 + a4 <= 0 && a0 + 147 <= 0) && 4 <= a2)) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || ((2 == a2 && 44 <= a29) && 98 + a0 <= 0)) || ((((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 2 == a2) && a0 + 147 <= 0)) || (((0 <= a29 + 127 && a2 == 1) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || (2 == a2 && 89 + a4 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (5 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))))) || ((((89 + a4 <= 0 && a29 <= 43) && (\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)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a29 <= 43)) && 4 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 4 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((4 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2))))) && a29 <= 43)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 3 == a2)) || (((42 + a4 <= 0 && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0)) || ((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)
[2022-11-02 20:49:21,774 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((42 + a4 <= 0 && a0 + 147 <= 0) && 4 <= a2)) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || ((2 == a2 && 44 <= a29) && 98 + a0 <= 0)) || ((((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 2 == a2) && a0 + 147 <= 0)) || (((0 <= a29 + 127 && a2 == 1) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || (2 == a2 && 89 + a4 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (5 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))))) || ((((89 + a4 <= 0 && a29 <= 43) && (\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)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a29 <= 43)) && 4 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 4 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((4 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2))))) && a29 <= 43)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 3 == a2)) || (((42 + a4 <= 0 && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0)) || ((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)
[2022-11-02 20:49:21,790 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((42 + a4 <= 0 && a0 + 147 <= 0) && 4 <= a2)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || ((2 == a2 && 44 <= a29) && 98 + a0 <= 0)) || ((42 + a4 <= 0 && 2 == a2) && a0 + 147 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || (2 == a2 && 89 + a4 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || ((((89 + a4 <= 0 && a29 <= 43) && (\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)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a29 <= 43)) && 4 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 4 <= a2)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 3 == a2)) || (((42 + a4 <= 0 && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0)) || ((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)
[2022-11-02 20:49:21,948 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 20:49:21,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:49:21,949 INFO L158 Benchmark]: Toolchain (without parser) took 98669.26ms. Allocated memory was 134.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 88.6MB in the beginning and 800.8MB in the end (delta: -712.1MB). Peak memory consumption was 586.1MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,949 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:49:21,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1437.22ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 88.4MB in the beginning and 128.1MB in the end (delta: -39.7MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 286.99ms. Allocated memory is still 188.7MB. Free memory was 128.1MB in the beginning and 126.7MB in the end (delta: 1.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,950 INFO L158 Benchmark]: Boogie Preprocessor took 276.05ms. Allocated memory is still 188.7MB. Free memory was 126.7MB in the beginning and 121.7MB in the end (delta: 5.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,951 INFO L158 Benchmark]: RCFGBuilder took 3671.76ms. Allocated memory was 188.7MB in the beginning and 354.4MB in the end (delta: 165.7MB). Free memory was 121.7MB in the beginning and 233.0MB in the end (delta: -111.3MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,955 INFO L158 Benchmark]: TraceAbstraction took 92697.99ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 231.9MB in the beginning and 824.3MB in the end (delta: -592.4MB). Peak memory consumption was 837.2MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,955 INFO L158 Benchmark]: Witness Printer took 273.15ms. Allocated memory is still 1.4GB. Free memory was 824.3MB in the beginning and 800.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2022-11-02 20:49:21,963 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.31ms. Allocated memory is still 134.2MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 1437.22ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 88.4MB in the beginning and 128.1MB in the end (delta: -39.7MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 286.99ms. Allocated memory is still 188.7MB. Free memory was 128.1MB in the beginning and 126.7MB in the end (delta: 1.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 276.05ms. Allocated memory is still 188.7MB. Free memory was 126.7MB in the beginning and 121.7MB in the end (delta: 5.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB.
* RCFGBuilder took 3671.76ms. Allocated memory was 188.7MB in the beginning and 354.4MB in the end (delta: 165.7MB). Free memory was 121.7MB in the beginning and 233.0MB in the end (delta: -111.3MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 92697.99ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 231.9MB in the beginning and 824.3MB in the end (delta: -592.4MB). Peak memory consumption was 837.2MB. Max. memory is 16.1GB.
* Witness Printer took 273.15ms. Allocated memory is still 1.4GB. Free memory was 824.3MB in the beginning and 800.8MB in the end (delta: 23.5MB). 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]
* 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: 212]: 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: 92.6s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 54.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8623 SdHoareTripleChecker+Valid, 50.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8623 mSDsluCounter, 8045 SdHoareTripleChecker+Invalid, 43.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 772 IncrementalHoareTripleChecker+Unchecked, 985 mSDsCounter, 4577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25916 IncrementalHoareTripleChecker+Invalid, 31265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4577 mSolverCounterUnsat, 7060 mSDtfsCounter, 25916 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3629 GetRequests, 3579 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20426occurred in iteration=18, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 17783 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 177 NumberOfFragments, 1377 HoareAnnotationTreeSize, 4 FomulaSimplifications, 21426 FormulaSimplificationTreeSizeReduction, 5.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 72238 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 14122 NumberOfCodeBlocks, 14122 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 14781 ConstructedInterpolants, 63 QuantifiedInterpolants, 47428 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3468 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 16820/17528 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: 1770]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 1668]: Loop Invariant
[2022-11-02 20:49:21,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,987 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,987 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,988 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,989 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,989 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,989 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
Derived loop invariant: ((((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((42 + a4 <= 0 && a0 + 147 <= 0) && 4 <= a2)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || ((2 == a2 && 44 <= a29) && 98 + a0 <= 0)) || ((42 + a4 <= 0 && 2 == a2) && a0 + 147 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || (2 == a2 && 89 + a4 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || ((((89 + a4 <= 0 && a29 <= 43) && (\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)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a29 <= 43)) && 4 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 4 <= a2)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 3 == a2)) || (((42 + a4 <= 0 && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0)) || ((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)
- InvariantResult [Line: 1776]: Loop Invariant
[2022-11-02 20:49:21,990 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,991 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,991 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:21,991 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,005 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,006 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
Derived loop invariant: (((((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((42 + a4 <= 0 && a0 + 147 <= 0) && 4 <= a2)) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || ((2 == a2 && 44 <= a29) && 98 + a0 <= 0)) || ((((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 2 == a2) && a0 + 147 <= 0)) || (((0 <= a29 + 127 && a2 == 1) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || (2 == a2 && 89 + a4 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (5 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))))) || ((((89 + a4 <= 0 && a29 <= 43) && (\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)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a29 <= 43)) && 4 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 4 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((4 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2))))) && a29 <= 43)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 3 == a2)) || (((42 + a4 <= 0 && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0)) || ((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)
- InvariantResult [Line: 33]: Loop Invariant
[2022-11-02 20:49:22,007 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
[2022-11-02 20:49:22,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED]
Derived loop invariant: (((((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((42 + a4 <= 0 && a0 + 147 <= 0) && 4 <= a2)) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || ((2 == a2 && 44 <= a29) && 98 + a0 <= 0)) || ((((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 2 == a2) && a0 + 147 <= 0)) || (((0 <= a29 + 127 && a2 == 1) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || (2 == a2 && 89 + a4 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (5 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2)))))) || ((((89 + a4 <= 0 && a29 <= 43) && (\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)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a29 <= 43)) && 4 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 4 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((4 <= a2 && (((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0) || ((0 <= a29 + 127 && 89 + a4 <= 0) && (!(input == 3) || !(input == a2))))) && a29 <= 43)) || ((89 + a4 <= 0 && !(98 + a0 <= 0)) && a0 + 61 <= 0)) || (89 + a4 <= 0 && 3 == a2)) || (((42 + a4 <= 0 && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0)) || ((2 == a2 && 0 <= a0 + 60) && a4 + 86 <= 0)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)
RESULT: Ultimate proved your program to be correct!
[2022-11-02 20:49:22,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c76fd28-5bc3-41c1-841d-ffdf5601d26e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE