./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/floppy.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF --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 986945cc1d8674c803a19893f7d2aec71de46e5693e78eba56c7bdad24c6e341 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:09:13,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:09:13,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:09:13,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:09:13,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:09:13,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:09:13,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:09:13,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:09:13,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:09:13,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:09:13,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:09:13,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:09:13,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:09:13,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:09:13,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:09:13,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:09:13,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:09:13,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:09:13,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:09:13,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:09:13,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:09:13,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:09:13,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:09:13,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:09:13,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:09:13,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:09:13,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:09:13,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:09:13,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:09:13,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:09:13,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:09:13,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:09:13,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:09:13,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:09:13,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:09:13,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:09:13,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:09:13,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:09:13,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:09:13,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:09:13,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:09:13,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 06:09:13,647 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:09:13,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:09:13,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:09:13,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:09:13,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:09:13,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:09:13,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:09:13,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:09:13,654 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:09:13,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:09:13,654 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:09:13,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:09:13,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:09:13,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:09:13,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:09:13,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:09:13,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:09:13,656 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:09:13,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:09:13,656 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:09:13,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:09:13,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:09:13,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:09:13,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:09:13,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:09:13,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:09:13,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:09:13,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:09:13,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:09:13,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:09:13,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:09:13,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:09:13,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:09:13,658 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:09:13,659 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_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/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_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF 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 -> 986945cc1d8674c803a19893f7d2aec71de46e5693e78eba56c7bdad24c6e341 [2021-11-20 06:09:13,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:09:13,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:09:13,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:09:13,996 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:09:13,997 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:09:13,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ntdrivers/floppy.i.cil-1.c [2021-11-20 06:09:14,115 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/data/8c34b2afe/66cbdf42feed4fa18541c7dda79c68e2/FLAG9cb026580 [2021-11-20 06:09:15,052 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:09:15,053 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/sv-benchmarks/c/ntdrivers/floppy.i.cil-1.c [2021-11-20 06:09:15,105 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/data/8c34b2afe/66cbdf42feed4fa18541c7dda79c68e2/FLAG9cb026580 [2021-11-20 06:09:15,516 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/data/8c34b2afe/66cbdf42feed4fa18541c7dda79c68e2 [2021-11-20 06:09:15,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:09:15,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:09:15,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:09:15,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:09:15,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:09:15,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:09:15" (1/1) ... [2021-11-20 06:09:15,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2920a0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:15, skipping insertion in model container [2021-11-20 06:09:15,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:09:15" (1/1) ... [2021-11-20 06:09:15,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:09:15,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:09:16,583 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_19aa0b3f-a18a-41c2-a447-3f47339cfe48/sv-benchmarks/c/ntdrivers/floppy.i.cil-1.c[76734,76747] [2021-11-20 06:09:17,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:09:17,269 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:09:17,377 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_19aa0b3f-a18a-41c2-a447-3f47339cfe48/sv-benchmarks/c/ntdrivers/floppy.i.cil-1.c[76734,76747] [2021-11-20 06:09:17,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:09:17,845 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:09:17,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17 WrapperNode [2021-11-20 06:09:17,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:09:17,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:09:17,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:09:17,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:09:17,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:17,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,150 INFO L137 Inliner]: procedures = 126, calls = 2874, calls flagged for inlining = 36, calls inlined = 25, statements flattened = 3043 [2021-11-20 06:09:18,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:09:18,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:09:18,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:09:18,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:09:18,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:09:18,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:09:18,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:09:18,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:09:18,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (1/1) ... [2021-11-20 06:09:18,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:09:18,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:18,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:18,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:09:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2021-11-20 06:09:18,539 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2021-11-20 06:09:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-20 06:09:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-20 06:09:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-20 06:09:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:09:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-11-20 06:09:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-11-20 06:09:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-20 06:09:18,540 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-20 06:09:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-11-20 06:09:18,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-11-20 06:09:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-11-20 06:09:18,541 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-11-20 06:09:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:09:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-11-20 06:09:18,542 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-11-20 06:09:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-11-20 06:09:18,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-11-20 06:09:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2021-11-20 06:09:18,542 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2021-11-20 06:09:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-20 06:09:18,543 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-20 06:09:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-11-20 06:09:18,543 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-11-20 06:09:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-11-20 06:09:18,544 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-11-20 06:09:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2021-11-20 06:09:18,544 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2021-11-20 06:09:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:09:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:09:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-11-20 06:09:18,545 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-11-20 06:09:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2021-11-20 06:09:18,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2021-11-20 06:09:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:09:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:09:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-11-20 06:09:18,546 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-11-20 06:09:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:09:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-11-20 06:09:18,547 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-11-20 06:09:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:09:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-11-20 06:09:18,547 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-11-20 06:09:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:09:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2021-11-20 06:09:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2021-11-20 06:09:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-20 06:09:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2021-11-20 06:09:18,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2021-11-20 06:09:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:09:18,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:09:19,192 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:09:19,194 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:09:19,255 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,271 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-11-20 06:09:19,271 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-11-20 06:09:19,275 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,422 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2021-11-20 06:09:19,422 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2021-11-20 06:09:19,447 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,461 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-11-20 06:09:19,462 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-11-20 06:09:19,575 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,607 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-11-20 06:09:19,607 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-11-20 06:09:19,608 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,610 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,611 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,720 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2021-11-20 06:09:19,720 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2021-11-20 06:09:19,720 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2021-11-20 06:09:19,720 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2021-11-20 06:09:19,721 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-11-20 06:09:19,721 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-11-20 06:09:19,724 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,733 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:19,735 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,668 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-11-20 06:09:22,669 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-11-20 06:09:22,669 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2021-11-20 06:09:22,669 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2021-11-20 06:09:22,669 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume !false; [2021-11-20 06:09:22,669 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume false; [2021-11-20 06:09:22,720 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,759 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-11-20 06:09:22,759 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-11-20 06:09:22,770 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,771 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,773 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,775 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,776 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,780 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,782 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:22,783 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:09:27,253 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !false; [2021-11-20 06:09:27,254 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume false; [2021-11-20 06:09:27,254 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume false; [2021-11-20 06:09:27,254 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2021-11-20 06:09:27,254 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2021-11-20 06:09:27,254 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##77: assume !false; [2021-11-20 06:09:27,255 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2021-11-20 06:09:27,255 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2021-11-20 06:09:27,255 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2021-11-20 06:09:27,255 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2021-11-20 06:09:27,255 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume false; [2021-11-20 06:09:27,255 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !false; [2021-11-20 06:09:27,256 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume false; [2021-11-20 06:09:27,256 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##211: assume !false; [2021-11-20 06:09:27,256 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-11-20 06:09:27,256 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-11-20 06:09:27,279 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:09:27,310 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:09:27,312 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 06:09:27,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:09:27 BoogieIcfgContainer [2021-11-20 06:09:27,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:09:27,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:09:27,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:09:27,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:09:27,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:09:15" (1/3) ... [2021-11-20 06:09:27,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209e9ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:09:27, skipping insertion in model container [2021-11-20 06:09:27,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:09:17" (2/3) ... [2021-11-20 06:09:27,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209e9ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:09:27, skipping insertion in model container [2021-11-20 06:09:27,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:09:27" (3/3) ... [2021-11-20 06:09:27,344 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy.i.cil-1.c [2021-11-20 06:09:27,352 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:09:27,353 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:09:27,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:09:27,480 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:09:27,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:09:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 564 states, 453 states have (on average 1.5011037527593818) internal successors, (680), 486 states have internal predecessors, (680), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2021-11-20 06:09:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 06:09:27,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:09:27,547 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:09:27,548 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:09:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -197079634, now seen corresponding path program 1 times [2021-11-20 06:09:27,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371926225] [2021-11-20 06:09:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:27,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:09:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:09:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:28,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:28,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371926225] [2021-11-20 06:09:28,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371926225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:09:28,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:09:28,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:09:28,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502872247] [2021-11-20 06:09:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:09:28,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:09:28,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:09:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:09:28,486 INFO L87 Difference]: Start difference. First operand has 564 states, 453 states have (on average 1.5011037527593818) internal successors, (680), 486 states have internal predecessors, (680), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:09:34,618 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:09:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:35,013 INFO L93 Difference]: Finished difference Result 1130 states and 1773 transitions. [2021-11-20 06:09:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:09:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-11-20 06:09:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:09:35,076 INFO L225 Difference]: With dead ends: 1130 [2021-11-20 06:09:35,077 INFO L226 Difference]: Without dead ends: 639 [2021-11-20 06:09:35,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:09:35,106 INFO L933 BasicCegarLoop]: 749 mSDtfsCounter, 393 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 226 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:09:35,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 2169 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 693 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2021-11-20 06:09:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-11-20 06:09:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 563. [2021-11-20 06:09:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 452 states have (on average 1.4623893805309736) internal successors, (661), 483 states have internal predecessors, (661), 90 states have call successors, (90), 21 states have call predecessors, (90), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-20 06:09:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 818 transitions. [2021-11-20 06:09:35,269 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 818 transitions. Word has length 26 [2021-11-20 06:09:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:09:35,270 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 818 transitions. [2021-11-20 06:09:35,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:09:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 818 transitions. [2021-11-20 06:09:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 06:09:35,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:09:35,274 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:09:35,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:09:35,274 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:09:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash -169212496, now seen corresponding path program 1 times [2021-11-20 06:09:35,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:35,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5361559] [2021-11-20 06:09:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:35,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:09:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:09:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:35,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:35,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5361559] [2021-11-20 06:09:35,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5361559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:09:35,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:09:35,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:09:35,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951902789] [2021-11-20 06:09:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:09:35,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:09:35,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:09:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:09:35,639 INFO L87 Difference]: Start difference. First operand 563 states and 818 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:09:41,169 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:09:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:41,486 INFO L93 Difference]: Finished difference Result 1183 states and 1738 transitions. [2021-11-20 06:09:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:09:41,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-11-20 06:09:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:09:41,497 INFO L225 Difference]: With dead ends: 1183 [2021-11-20 06:09:41,497 INFO L226 Difference]: Without dead ends: 639 [2021-11-20 06:09:41,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:09:41,502 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 359 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 218 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:09:41,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 2829 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 822 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2021-11-20 06:09:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-11-20 06:09:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 563. [2021-11-20 06:09:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 452 states have (on average 1.4601769911504425) internal successors, (660), 483 states have internal predecessors, (660), 90 states have call successors, (90), 21 states have call predecessors, (90), 20 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-20 06:09:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 817 transitions. [2021-11-20 06:09:41,554 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 817 transitions. Word has length 29 [2021-11-20 06:09:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:09:41,554 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 817 transitions. [2021-11-20 06:09:41,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:09:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 817 transitions. [2021-11-20 06:09:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 06:09:41,556 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:09:41,556 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:09:41,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:09:41,557 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:09:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1081663514, now seen corresponding path program 1 times [2021-11-20 06:09:41,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137306042] [2021-11-20 06:09:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:41,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:09:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:09:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:41,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137306042] [2021-11-20 06:09:41,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137306042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:09:41,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:09:41,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:09:41,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364185147] [2021-11-20 06:09:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:09:41,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:09:41,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:09:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:09:41,844 INFO L87 Difference]: Start difference. First operand 563 states and 817 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:09:46,688 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:09:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:48,504 INFO L93 Difference]: Finished difference Result 1494 states and 2232 transitions. [2021-11-20 06:09:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:09:48,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-11-20 06:09:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:09:48,521 INFO L225 Difference]: With dead ends: 1494 [2021-11-20 06:09:48,522 INFO L226 Difference]: Without dead ends: 1093 [2021-11-20 06:09:48,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:09:48,528 INFO L933 BasicCegarLoop]: 913 mSDtfsCounter, 1298 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 407 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:09:48,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1330 Valid, 2424 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 941 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2021-11-20 06:09:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-11-20 06:09:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 979. [2021-11-20 06:09:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 813 states have (on average 1.4452644526445264) internal successors, (1175), 840 states have internal predecessors, (1175), 124 states have call successors, (124), 38 states have call predecessors, (124), 41 states have return successors, (147), 108 states have call predecessors, (147), 109 states have call successors, (147) [2021-11-20 06:09:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1446 transitions. [2021-11-20 06:09:48,637 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1446 transitions. Word has length 33 [2021-11-20 06:09:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:09:48,637 INFO L470 AbstractCegarLoop]: Abstraction has 979 states and 1446 transitions. [2021-11-20 06:09:48,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:09:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1446 transitions. [2021-11-20 06:09:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 06:09:48,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:09:48,651 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:09:48,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:09:48,651 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:09:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1331144769, now seen corresponding path program 1 times [2021-11-20 06:09:48,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:48,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59130160] [2021-11-20 06:09:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:48,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:09:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:09:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 06:09:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:49,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59130160] [2021-11-20 06:09:49,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59130160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:09:49,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:09:49,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:09:49,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638263736] [2021-11-20 06:09:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:09:49,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:09:49,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:09:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:09:49,066 INFO L87 Difference]: Start difference. First operand 979 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:09:53,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:09:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:54,933 INFO L93 Difference]: Finished difference Result 1814 states and 2766 transitions. [2021-11-20 06:09:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:09:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2021-11-20 06:09:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:09:54,952 INFO L225 Difference]: With dead ends: 1814 [2021-11-20 06:09:54,952 INFO L226 Difference]: Without dead ends: 1796 [2021-11-20 06:09:54,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:09:54,958 INFO L933 BasicCegarLoop]: 769 mSDtfsCounter, 1429 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 386 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:09:54,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 2048 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 740 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2021-11-20 06:09:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2021-11-20 06:09:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1569. [2021-11-20 06:09:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1311 states have (on average 1.4683447749809306) internal successors, (1925), 1356 states have internal predecessors, (1925), 189 states have call successors, (189), 61 states have call predecessors, (189), 68 states have return successors, (250), 164 states have call predecessors, (250), 174 states have call successors, (250) [2021-11-20 06:09:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2364 transitions. [2021-11-20 06:09:55,081 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2364 transitions. Word has length 45 [2021-11-20 06:09:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:09:55,081 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 2364 transitions. [2021-11-20 06:09:55,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:09:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2364 transitions. [2021-11-20 06:09:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-20 06:09:55,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:09:55,085 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:09:55,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 06:09:55,086 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:09:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1069708837, now seen corresponding path program 1 times [2021-11-20 06:09:55,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:55,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191705786] [2021-11-20 06:09:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:55,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:09:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:09:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:55,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:55,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191705786] [2021-11-20 06:09:55,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191705786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:09:55,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:09:55,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:09:55,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185156049] [2021-11-20 06:09:55,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:09:55,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:09:55,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:09:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:09:55,429 INFO L87 Difference]: Start difference. First operand 1569 states and 2364 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:10:00,974 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:01,470 INFO L93 Difference]: Finished difference Result 1793 states and 2748 transitions. [2021-11-20 06:10:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:10:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2021-11-20 06:10:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:01,486 INFO L225 Difference]: With dead ends: 1793 [2021-11-20 06:10:01,486 INFO L226 Difference]: Without dead ends: 1789 [2021-11-20 06:10:01,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:10:01,488 INFO L933 BasicCegarLoop]: 714 mSDtfsCounter, 460 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 234 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:01,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 2047 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 689 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2021-11-20 06:10:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2021-11-20 06:10:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1602. [2021-11-20 06:10:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1342 states have (on average 1.4679582712369597) internal successors, (1970), 1384 states have internal predecessors, (1970), 190 states have call successors, (190), 63 states have call predecessors, (190), 69 states have return successors, (251), 165 states have call predecessors, (251), 175 states have call successors, (251) [2021-11-20 06:10:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2411 transitions. [2021-11-20 06:10:01,585 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2411 transitions. Word has length 43 [2021-11-20 06:10:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:01,586 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 2411 transitions. [2021-11-20 06:10:01,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:10:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2411 transitions. [2021-11-20 06:10:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 06:10:01,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:01,588 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:01,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 06:10:01,588 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -897411344, now seen corresponding path program 1 times [2021-11-20 06:10:01,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:01,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432411118] [2021-11-20 06:10:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:01,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:10:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:01,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:01,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432411118] [2021-11-20 06:10:01,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432411118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:10:01,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:10:01,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:10:01,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966566290] [2021-11-20 06:10:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:10:01,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:10:01,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:10:01,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:10:01,841 INFO L87 Difference]: Start difference. First operand 1602 states and 2411 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:10:05,742 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:07,869 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:09,914 INFO L93 Difference]: Finished difference Result 3169 states and 4941 transitions. [2021-11-20 06:10:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:10:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-11-20 06:10:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:09,943 INFO L225 Difference]: With dead ends: 3169 [2021-11-20 06:10:09,944 INFO L226 Difference]: Without dead ends: 3166 [2021-11-20 06:10:09,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:10:09,949 INFO L933 BasicCegarLoop]: 1138 mSDtfsCounter, 901 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 297 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:09,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 2944 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1076 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2021-11-20 06:10:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2021-11-20 06:10:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 2550. [2021-11-20 06:10:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2173 states have (on average 1.4832029452369995) internal successors, (3223), 2225 states have internal predecessors, (3223), 266 states have call successors, (266), 99 states have call predecessors, (266), 110 states have return successors, (392), 236 states have call predecessors, (392), 251 states have call successors, (392) [2021-11-20 06:10:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3881 transitions. [2021-11-20 06:10:10,129 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3881 transitions. Word has length 45 [2021-11-20 06:10:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:10,130 INFO L470 AbstractCegarLoop]: Abstraction has 2550 states and 3881 transitions. [2021-11-20 06:10:10,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:10:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3881 transitions. [2021-11-20 06:10:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-20 06:10:10,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:10,133 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:10,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 06:10:10,134 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash -285485209, now seen corresponding path program 1 times [2021-11-20 06:10:10,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:10,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465622360] [2021-11-20 06:10:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:10,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:10:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-20 06:10:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:10:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:10,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:10,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465622360] [2021-11-20 06:10:10,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465622360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:10:10,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:10:10,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 06:10:10,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687576481] [2021-11-20 06:10:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:10:10,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 06:10:10,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:10,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 06:10:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:10:10,523 INFO L87 Difference]: Start difference. First operand 2550 states and 3881 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:10:15,955 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:18,259 INFO L93 Difference]: Finished difference Result 3798 states and 5980 transitions. [2021-11-20 06:10:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 06:10:18,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-11-20 06:10:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:18,292 INFO L225 Difference]: With dead ends: 3798 [2021-11-20 06:10:18,293 INFO L226 Difference]: Without dead ends: 3790 [2021-11-20 06:10:18,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2021-11-20 06:10:18,297 INFO L933 BasicCegarLoop]: 1044 mSDtfsCounter, 2650 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 1070 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 3214 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:18,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2710 Valid, 3214 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 1988 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2021-11-20 06:10:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2021-11-20 06:10:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3139. [2021-11-20 06:10:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 2670 states have (on average 1.4876404494382023) internal successors, (3972), 2741 states have internal predecessors, (3972), 332 states have call successors, (332), 116 states have call predecessors, (332), 136 states have return successors, (525), 292 states have call predecessors, (525), 317 states have call successors, (525) [2021-11-20 06:10:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 4829 transitions. [2021-11-20 06:10:18,512 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 4829 transitions. Word has length 47 [2021-11-20 06:10:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:18,512 INFO L470 AbstractCegarLoop]: Abstraction has 3139 states and 4829 transitions. [2021-11-20 06:10:18,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:10:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 4829 transitions. [2021-11-20 06:10:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 06:10:18,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:18,514 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:18,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 06:10:18,515 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1518670529, now seen corresponding path program 1 times [2021-11-20 06:10:18,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:18,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075575714] [2021-11-20 06:10:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:18,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:10:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 06:10:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:18,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:18,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075575714] [2021-11-20 06:10:18,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075575714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:10:18,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:10:18,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:10:18,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712341658] [2021-11-20 06:10:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:10:18,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:10:18,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:10:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:10:18,804 INFO L87 Difference]: Start difference. First operand 3139 states and 4829 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:10:22,413 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:25,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:26,088 INFO L93 Difference]: Finished difference Result 9987 states and 15921 transitions. [2021-11-20 06:10:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:10:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2021-11-20 06:10:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:26,144 INFO L225 Difference]: With dead ends: 9987 [2021-11-20 06:10:26,144 INFO L226 Difference]: Without dead ends: 7066 [2021-11-20 06:10:26,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:10:26,166 INFO L933 BasicCegarLoop]: 957 mSDtfsCounter, 1297 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 339 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:26,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 2407 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 804 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2021-11-20 06:10:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2021-11-20 06:10:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 6230. [2021-11-20 06:10:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6230 states, 5324 states have (on average 1.5005634861006762) internal successors, (7989), 5487 states have internal predecessors, (7989), 647 states have call successors, (647), 214 states have call predecessors, (647), 258 states have return successors, (1139), 551 states have call predecessors, (1139), 635 states have call successors, (1139) [2021-11-20 06:10:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 9775 transitions. [2021-11-20 06:10:26,600 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 9775 transitions. Word has length 46 [2021-11-20 06:10:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:26,601 INFO L470 AbstractCegarLoop]: Abstraction has 6230 states and 9775 transitions. [2021-11-20 06:10:26,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:10:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 9775 transitions. [2021-11-20 06:10:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 06:10:26,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:26,603 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:26,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 06:10:26,604 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2006170664, now seen corresponding path program 1 times [2021-11-20 06:10:26,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:26,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626312992] [2021-11-20 06:10:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:26,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:10:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:26,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626312992] [2021-11-20 06:10:26,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626312992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:10:26,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:10:26,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:10:26,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815554790] [2021-11-20 06:10:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:10:26,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:10:26,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:10:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:10:26,933 INFO L87 Difference]: Start difference. First operand 6230 states and 9775 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:10:30,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:32,754 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:34,409 INFO L93 Difference]: Finished difference Result 13181 states and 20868 transitions. [2021-11-20 06:10:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:10:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-11-20 06:10:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:34,481 INFO L225 Difference]: With dead ends: 13181 [2021-11-20 06:10:34,481 INFO L226 Difference]: Without dead ends: 7261 [2021-11-20 06:10:34,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:10:34,514 INFO L933 BasicCegarLoop]: 907 mSDtfsCounter, 2164 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 694 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:34,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2207 Valid, 2279 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 1128 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2021-11-20 06:10:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7261 states. [2021-11-20 06:10:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7261 to 6221. [2021-11-20 06:10:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 5315 states have (on average 1.4991533396048917) internal successors, (7968), 5478 states have internal predecessors, (7968), 647 states have call successors, (647), 214 states have call predecessors, (647), 258 states have return successors, (1139), 551 states have call predecessors, (1139), 635 states have call successors, (1139) [2021-11-20 06:10:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 9754 transitions. [2021-11-20 06:10:35,037 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 9754 transitions. Word has length 46 [2021-11-20 06:10:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:35,038 INFO L470 AbstractCegarLoop]: Abstraction has 6221 states and 9754 transitions. [2021-11-20 06:10:35,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:10:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 9754 transitions. [2021-11-20 06:10:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:10:35,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:35,041 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:35,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 06:10:35,041 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash -703618871, now seen corresponding path program 1 times [2021-11-20 06:10:35,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:35,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177305349] [2021-11-20 06:10:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:35,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:10:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-20 06:10:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:10:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:35,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177305349] [2021-11-20 06:10:35,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177305349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:10:35,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:10:35,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 06:10:35,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959061140] [2021-11-20 06:10:35,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:10:35,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 06:10:35,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:35,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 06:10:35,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:10:35,351 INFO L87 Difference]: Start difference. First operand 6221 states and 9754 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:10:41,114 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:43,557 INFO L93 Difference]: Finished difference Result 7131 states and 11388 transitions. [2021-11-20 06:10:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 06:10:43,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2021-11-20 06:10:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:43,587 INFO L225 Difference]: With dead ends: 7131 [2021-11-20 06:10:43,588 INFO L226 Difference]: Without dead ends: 7126 [2021-11-20 06:10:43,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2021-11-20 06:10:43,593 INFO L933 BasicCegarLoop]: 1024 mSDtfsCounter, 2455 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 925 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:43,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2516 Valid, 3156 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 1986 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2021-11-20 06:10:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2021-11-20 06:10:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 6221. [2021-11-20 06:10:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 5315 states have (on average 1.4989651928504233) internal successors, (7967), 5478 states have internal predecessors, (7967), 647 states have call successors, (647), 214 states have call predecessors, (647), 258 states have return successors, (1139), 551 states have call predecessors, (1139), 635 states have call successors, (1139) [2021-11-20 06:10:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 9753 transitions. [2021-11-20 06:10:44,041 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 9753 transitions. Word has length 48 [2021-11-20 06:10:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:44,041 INFO L470 AbstractCegarLoop]: Abstraction has 6221 states and 9753 transitions. [2021-11-20 06:10:44,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:10:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 9753 transitions. [2021-11-20 06:10:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-20 06:10:44,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:44,044 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:44,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 06:10:44,045 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash -611856162, now seen corresponding path program 1 times [2021-11-20 06:10:44,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:44,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316151193] [2021-11-20 06:10:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:44,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 06:10:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-20 06:10:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:10:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:44,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:44,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316151193] [2021-11-20 06:10:44,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316151193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:10:44,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:10:44,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 06:10:44,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56440555] [2021-11-20 06:10:44,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:10:44,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:10:44,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:10:44,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:10:44,511 INFO L87 Difference]: Start difference. First operand 6221 states and 9753 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:10:50,156 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:52,199 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:53,644 INFO L93 Difference]: Finished difference Result 13280 states and 21298 transitions. [2021-11-20 06:10:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:10:53,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2021-11-20 06:10:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:53,674 INFO L225 Difference]: With dead ends: 13280 [2021-11-20 06:10:53,674 INFO L226 Difference]: Without dead ends: 7024 [2021-11-20 06:10:53,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:10:53,724 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 657 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 261 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:53,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [678 Valid, 3154 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1545 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2021-11-20 06:10:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7024 states. [2021-11-20 06:10:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7024 to 6248. [2021-11-20 06:10:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6248 states, 5340 states have (on average 1.496629213483146) internal successors, (7992), 5505 states have internal predecessors, (7992), 647 states have call successors, (647), 214 states have call predecessors, (647), 260 states have return successors, (1144), 551 states have call predecessors, (1144), 635 states have call successors, (1144) [2021-11-20 06:10:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6248 states to 6248 states and 9783 transitions. [2021-11-20 06:10:54,179 INFO L78 Accepts]: Start accepts. Automaton has 6248 states and 9783 transitions. Word has length 49 [2021-11-20 06:10:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:54,180 INFO L470 AbstractCegarLoop]: Abstraction has 6248 states and 9783 transitions. [2021-11-20 06:10:54,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:10:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6248 states and 9783 transitions. [2021-11-20 06:10:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-20 06:10:54,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:54,182 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:10:54,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 06:10:54,183 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1052684790, now seen corresponding path program 1 times [2021-11-20 06:10:54,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:10:54,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276982043] [2021-11-20 06:10:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:54,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:10:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:10:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:54,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 06:10:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-20 06:10:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:10:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:54,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:10:54,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276982043] [2021-11-20 06:10:54,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276982043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:10:54,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519095189] [2021-11-20 06:10:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:10:54,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:10:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:10:54,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:10:54,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:10:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:10:55,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 2119 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 06:10:55,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:10:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:55,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:10:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:10:56,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519095189] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:10:56,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:10:56,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-11-20 06:10:56,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534196288] [2021-11-20 06:10:56,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:10:56,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 06:10:56,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:10:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:10:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:10:56,116 INFO L87 Difference]: Start difference. First operand 6248 states and 9783 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:11:02,629 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:11:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:11:03,998 INFO L93 Difference]: Finished difference Result 13331 states and 21354 transitions. [2021-11-20 06:11:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 06:11:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 50 [2021-11-20 06:11:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:11:04,031 INFO L225 Difference]: With dead ends: 13331 [2021-11-20 06:11:04,031 INFO L226 Difference]: Without dead ends: 7047 [2021-11-20 06:11:04,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2021-11-20 06:11:04,059 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 1040 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 482 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:11:04,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 4070 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 1739 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2021-11-20 06:11:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2021-11-20 06:11:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 6271. [2021-11-20 06:11:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6271 states, 5363 states have (on average 1.4944993473801977) internal successors, (8015), 5528 states have internal predecessors, (8015), 647 states have call successors, (647), 214 states have call predecessors, (647), 260 states have return successors, (1144), 551 states have call predecessors, (1144), 635 states have call successors, (1144) [2021-11-20 06:11:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 9806 transitions. [2021-11-20 06:11:04,490 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 9806 transitions. Word has length 50 [2021-11-20 06:11:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:11:04,491 INFO L470 AbstractCegarLoop]: Abstraction has 6271 states and 9806 transitions. [2021-11-20 06:11:04,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:11:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 9806 transitions. [2021-11-20 06:11:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-20 06:11:04,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:11:04,493 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:11:04,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:11:04,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:11:04,709 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:11:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:11:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1656968926, now seen corresponding path program 2 times [2021-11-20 06:11:04,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:11:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389588232] [2021-11-20 06:11:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:11:04,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:11:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:04,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:11:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-20 06:11:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 06:11:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:11:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:11:05,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:11:05,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389588232] [2021-11-20 06:11:05,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389588232] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:11:05,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689880429] [2021-11-20 06:11:05,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:11:05,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:11:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:11:05,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:11:05,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:11:11,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:11:11,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:11:11,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 2137 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:11:11,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:11:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:11:11,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:11:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:11:12,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689880429] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:11:12,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:11:12,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2021-11-20 06:11:12,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298599565] [2021-11-20 06:11:12,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:11:12,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 06:11:12,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:11:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 06:11:12,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-11-20 06:11:12,144 INFO L87 Difference]: Start difference. First operand 6271 states and 9806 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:11:20,604 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:11:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:11:22,190 INFO L93 Difference]: Finished difference Result 13497 states and 21603 transitions. [2021-11-20 06:11:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-20 06:11:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2021-11-20 06:11:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:11:22,220 INFO L225 Difference]: With dead ends: 13497 [2021-11-20 06:11:22,220 INFO L226 Difference]: Without dead ends: 7113 [2021-11-20 06:11:22,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=485, Invalid=1585, Unknown=0, NotChecked=0, Total=2070 [2021-11-20 06:11:22,245 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 895 mSDsluCounter, 4032 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 423 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 4731 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:11:22,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 4731 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2021-11-20 06:11:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7113 states. [2021-11-20 06:11:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7113 to 6337. [2021-11-20 06:11:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6337 states, 5429 states have (on average 1.488487750967029) internal successors, (8081), 5594 states have internal predecessors, (8081), 647 states have call successors, (647), 214 states have call predecessors, (647), 260 states have return successors, (1144), 551 states have call predecessors, (1144), 635 states have call successors, (1144) [2021-11-20 06:11:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 9872 transitions. [2021-11-20 06:11:22,705 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 9872 transitions. Word has length 53 [2021-11-20 06:11:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:11:22,706 INFO L470 AbstractCegarLoop]: Abstraction has 6337 states and 9872 transitions. [2021-11-20 06:11:22,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:11:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 9872 transitions. [2021-11-20 06:11:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-20 06:11:22,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:11:22,714 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:11:22,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:11:22,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 06:11:22,929 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:11:22,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:11:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1523908574, now seen corresponding path program 3 times [2021-11-20 06:11:22,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:11:22,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826689885] [2021-11-20 06:11:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:11:22,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:11:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:11:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-20 06:11:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-20 06:11:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:11:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:11:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:11:24,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:11:24,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826689885] [2021-11-20 06:11:24,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826689885] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:11:24,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75747202] [2021-11-20 06:11:24,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:11:24,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:11:24,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:11:24,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:11:24,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 06:14:39,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-20 06:14:39,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:14:39,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 2173 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-20 06:14:39,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:14:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:14:39,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:14:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:14:40,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75747202] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:14:40,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:14:40,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 33 [2021-11-20 06:14:40,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682815805] [2021-11-20 06:14:40,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:14:40,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-20 06:14:40,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:14:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-20 06:14:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 06:14:40,840 INFO L87 Difference]: Start difference. First operand 6337 states and 9872 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 29 states have internal predecessors, (79), 3 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-20 06:15:07,632 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:15:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:15:09,570 INFO L93 Difference]: Finished difference Result 13809 states and 22041 transitions. [2021-11-20 06:15:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-20 06:15:09,571 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 29 states have internal predecessors, (79), 3 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 59 [2021-11-20 06:15:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:15:09,604 INFO L225 Difference]: With dead ends: 13809 [2021-11-20 06:15:09,604 INFO L226 Difference]: Without dead ends: 7245 [2021-11-20 06:15:09,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1421, Invalid=4585, Unknown=0, NotChecked=0, Total=6006 [2021-11-20 06:15:09,679 INFO L933 BasicCegarLoop]: 702 mSDtfsCounter, 964 mSDsluCounter, 8546 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 514 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 9248 SdHoareTripleChecker+Invalid, 4897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:15:09,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 9248 Invalid, 4897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 4382 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2021-11-20 06:15:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7245 states. [2021-11-20 06:15:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7245 to 6469. [2021-11-20 06:15:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6469 states, 5561 states have (on average 1.4768926452076965) internal successors, (8213), 5726 states have internal predecessors, (8213), 647 states have call successors, (647), 214 states have call predecessors, (647), 260 states have return successors, (1144), 551 states have call predecessors, (1144), 635 states have call successors, (1144) [2021-11-20 06:15:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6469 states to 6469 states and 10004 transitions. [2021-11-20 06:15:10,201 INFO L78 Accepts]: Start accepts. Automaton has 6469 states and 10004 transitions. Word has length 59 [2021-11-20 06:15:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:15:10,202 INFO L470 AbstractCegarLoop]: Abstraction has 6469 states and 10004 transitions. [2021-11-20 06:15:10,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 29 states have internal predecessors, (79), 3 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-20 06:15:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 6469 states and 10004 transitions. [2021-11-20 06:15:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-20 06:15:10,211 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:15:10,211 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:15:10,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:15:10,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:10,425 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:15:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:15:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1149216747, now seen corresponding path program 1 times [2021-11-20 06:15:10,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:15:10,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397192053] [2021-11-20 06:15:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:10,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:15:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:15:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-20 06:15:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 06:15:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:15:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:12,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:15:12,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397192053] [2021-11-20 06:15:12,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397192053] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:15:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853266070] [2021-11-20 06:15:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:15:12,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:15:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:15:12,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:15:12,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 06:15:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:15:14,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 2246 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-20 06:15:14,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:15:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:16,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:15:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:15:20,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853266070] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:15:20,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:15:20,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 77 [2021-11-20 06:15:20,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241783530] [2021-11-20 06:15:20,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:15:20,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-11-20 06:15:20,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:15:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-11-20 06:15:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1301, Invalid=4551, Unknown=0, NotChecked=0, Total=5852 [2021-11-20 06:15:20,433 INFO L87 Difference]: Start difference. First operand 6469 states and 10004 transitions. Second operand has 77 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 73 states have internal predecessors, (124), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:16:16,712 WARN L227 SmtUtils]: Spent 14.73s on a formula simplification. DAG size of input: 130 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:16:18,843 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse0 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (= |c_old(#length)| |c_#length|) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296) .cse1)) (or .cse0 (< (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse1)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296) .cse1) .cse0) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296) .cse1) .cse0) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296) .cse1) .cse0) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296) .cse1) .cse0) (or .cse0 (< (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296) .cse1)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296) .cse1) .cse0) (or (< (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296) .cse1)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296) .cse1)) (= |c_old(#valid)| |c_#valid|) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296) .cse1)) (= c_~s~0 |c_old(~s~0)|) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296) .cse1) .cse0))) is different from false [2021-11-20 06:16:48,378 WARN L227 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 115 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:17:20,691 WARN L227 SmtUtils]: Spent 9.22s on a formula simplification. DAG size of input: 110 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:17:49,201 WARN L227 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 105 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:18:30,183 WARN L227 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 100 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:18:55,909 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse0 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (= |c_old(#length)| |c_#length|) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296) .cse1)) (or .cse0 (< (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse1)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296) .cse1) .cse0) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296) .cse1) .cse0) (or .cse0 (< (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296) .cse1)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296) .cse1)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296) .cse1) .cse0) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296) .cse1)) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296) .cse1)) (= |c_old(#valid)| |c_#valid|) (or .cse0 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296) .cse1)) (= c_~s~0 |c_old(~s~0)|) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296) .cse1) .cse0))) is different from false [2021-11-20 06:20:22,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:20:32,246 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:20:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:20:35,093 INFO L93 Difference]: Finished difference Result 14434 states and 22918 transitions. [2021-11-20 06:20:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-11-20 06:20:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 73 states have internal predecessors, (124), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2021-11-20 06:20:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:20:35,125 INFO L225 Difference]: With dead ends: 14434 [2021-11-20 06:20:35,125 INFO L226 Difference]: Without dead ends: 7509 [2021-11-20 06:20:35,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 298.1s TimeCoverageRelationStatistics Valid=5198, Invalid=20562, Unknown=8, NotChecked=638, Total=26406 [2021-11-20 06:20:35,231 INFO L933 BasicCegarLoop]: 709 mSDtfsCounter, 1411 mSDsluCounter, 17824 mSDsCounter, 0 mSdLazyCounter, 10263 mSolverCounterSat, 939 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 18533 SdHoareTripleChecker+Invalid, 11207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 10263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:20:35,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1432 Valid, 18533 Invalid, 11207 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [939 Valid, 10263 Invalid, 1 Unknown, 4 Unchecked, 22.6s Time] [2021-11-20 06:20:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2021-11-20 06:20:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 6733. [2021-11-20 06:20:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 5825 states have (on average 1.4552789699570816) internal successors, (8477), 5990 states have internal predecessors, (8477), 647 states have call successors, (647), 214 states have call predecessors, (647), 260 states have return successors, (1144), 551 states have call predecessors, (1144), 635 states have call successors, (1144) [2021-11-20 06:20:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 10268 transitions. [2021-11-20 06:20:35,774 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 10268 transitions. Word has length 72 [2021-11-20 06:20:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:20:35,775 INFO L470 AbstractCegarLoop]: Abstraction has 6733 states and 10268 transitions. [2021-11-20 06:20:35,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 73 states have internal predecessors, (124), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:20:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 10268 transitions. [2021-11-20 06:20:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-20 06:20:35,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:20:35,778 INFO L514 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:20:35,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-20 06:20:35,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 06:20:35,980 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:20:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:20:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash -871025186, now seen corresponding path program 4 times [2021-11-20 06:20:35,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:20:35,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573937655] [2021-11-20 06:20:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:20:35,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:20:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:20:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-20 06:20:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-20 06:20:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:20:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:20:41,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:20:41,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573937655] [2021-11-20 06:20:41,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573937655] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:20:41,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816051791] [2021-11-20 06:20:41,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:20:41,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:20:41,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:20:41,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:20:41,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19aa0b3f-a18a-41c2-a447-3f47339cfe48/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 06:20:54,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:20:54,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:20:54,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 2389 conjuncts, 98 conjunts are in the unsatisfiable core [2021-11-20 06:20:54,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:21:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:21:01,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:21:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:21:24,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816051791] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:21:24,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:21:24,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 50, 50] total 149 [2021-11-20 06:21:24,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273409751] [2021-11-20 06:21:24,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:21:24,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2021-11-20 06:21:24,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:21:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2021-11-20 06:21:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4909, Invalid=17143, Unknown=0, NotChecked=0, Total=22052 [2021-11-20 06:21:24,940 INFO L87 Difference]: Start difference. First operand 6733 states and 10268 transitions. Second operand has 149 states, 149 states have (on average 1.308724832214765) internal successors, (195), 145 states have internal predecessors, (195), 2 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 06:21:38,426 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse8 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296)) (.cse9 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse35 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse38 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse22 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse39 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296)) (.cse36 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse34 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse37 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse40 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse41 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (= |c_old(#length)| |c_#length|) (or (<= .cse0 .cse6) .cse2 (< .cse7 .cse0)) (or (<= .cse0 .cse8) .cse2 (< .cse9 .cse0)) (or .cse2 (<= .cse0 .cse10) (< .cse11 .cse0)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 45) 4294967296) .cse0) (<= .cse0 .cse12)) (or (<= .cse0 .cse13) (< .cse14 .cse0) .cse2) (or (< .cse15 .cse0) .cse2 (<= .cse0 .cse16)) (or (< .cse17 .cse0) .cse2 (<= .cse0 .cse18)) (or .cse2 (<= .cse0 .cse19) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse19 .cse0)) (or (< .cse20 .cse0) .cse2 (<= .cse0 .cse21)) (or .cse2 (< .cse22 .cse0)) (or (<= .cse0 .cse7) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 42) 4294967296) .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse23) .cse2) (or (<= .cse0 .cse24) (< .cse25 .cse0) .cse2) (or .cse2 (< .cse26 .cse0)) (or .cse2 (<= .cse0 .cse17) (< (mod (+ 41 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (< .cse24 .cse0) .cse2 (<= .cse0 .cse26)) (or (< .cse18 .cse0) (<= .cse0 .cse27) .cse2) (or (<= .cse0 .cse11) .cse2 (< .cse28 .cse0)) (or .cse2 (< .cse29 .cse0)) (or (<= .cse0 .cse15) .cse2 (< .cse8 .cse0)) (or (< .cse30 .cse0) .cse2 (<= .cse0 .cse31)) (or .cse2 (< .cse21 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse31 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 43) 4294967296) .cse0) (<= .cse0 .cse32) .cse2) (or (<= .cse0 .cse33) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 46) 4294967296) .cse0)) (or .cse2 (< .cse34 .cse0) (<= .cse0 .cse25)) (or (<= .cse0 .cse35) (< .cse6 .cse0) .cse2) (or (< .cse33 .cse0) .cse2 (<= .cse0 .cse36)) (or .cse2 (< .cse37 .cse0) (<= .cse0 .cse9)) (or (<= .cse0 .cse14) (< .cse10 .cse0) .cse2) (or .cse2 (<= .cse0 .cse20) (< .cse27 .cse0)) (or .cse2 (< .cse35 .cse0) (<= .cse0 .cse38)) (or .cse2 (< .cse12 .cse0) (<= .cse0 .cse28)) (or .cse2 (< .cse38 .cse0) (<= .cse0 .cse39)) (or .cse2 (< .cse13 .cse0)) (or (<= .cse0 .cse22) .cse2 (< .cse39 .cse0)) (or (<= .cse0 .cse30) .cse2 (< .cse32 .cse0)) (= |c_old(#valid)| |c_#valid|) (or (< .cse36 .cse0) .cse2 (<= .cse0 .cse34)) (or .cse2 (< .cse16 .cse0)) (or (< .cse40 .cse0) .cse2 (<= .cse0 .cse37)) (= c_~s~0 |c_old(~s~0)|) (or (<= .cse0 .cse29) .cse2 (< .cse1 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 44) 4294967296) .cse0) .cse2 (<= .cse0 .cse40)) (or (<= .cse0 .cse41) .cse2 (< .cse23 .cse0)) (or (< .cse41 .cse0) .cse2))) is different from false [2021-11-20 06:21:40,535 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse8 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse9 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse34 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse37 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse22 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse38 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296)) (.cse35 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse36 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse39 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse40 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< .cse7 .cse0)) (or (<= .cse0 .cse8) .cse2 (< .cse9 .cse0)) (or .cse2 (<= .cse0 .cse10) (< .cse11 .cse0)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 45) 4294967296) .cse0) (<= .cse0 .cse12)) (or (<= .cse0 .cse13) (< .cse14 .cse0) .cse2) (or (< .cse15 .cse0) .cse2 (<= .cse0 .cse16)) (or (< .cse17 .cse0) .cse2 (<= .cse0 .cse18)) (or .cse2 (<= .cse0 .cse19) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse19 .cse0)) (or (< .cse20 .cse0) .cse2 (<= .cse0 .cse21)) (or .cse2 (< .cse22 .cse0)) (or (<= .cse0 .cse7) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 42) 4294967296) .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse23) .cse2) (or (<= .cse0 .cse24) (< .cse25 .cse0) .cse2) (or .cse2 (< .cse26 .cse0)) (or .cse2 (<= .cse0 .cse17) (< (mod (+ 41 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (< .cse24 .cse0) .cse2 (<= .cse0 .cse26)) (or (< .cse18 .cse0) (<= .cse0 .cse27) .cse2) (or (<= .cse0 .cse11) .cse2 (< .cse28 .cse0)) (or .cse2 (< .cse29 .cse0)) (or (<= .cse0 .cse15) .cse2 (< .cse8 .cse0)) (or (< .cse30 .cse0) .cse2 (<= .cse0 .cse31)) (or .cse2 (< .cse21 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse31 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 43) 4294967296) .cse0) (<= .cse0 .cse32) .cse2) (or .cse2 (< .cse33 .cse0) (<= .cse0 .cse25)) (or (<= .cse0 .cse34) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse35)) (or .cse2 (< .cse36 .cse0) (<= .cse0 .cse9)) (or (<= .cse0 .cse14) (< .cse10 .cse0) .cse2) (or .cse2 (<= .cse0 .cse20) (< .cse27 .cse0)) (or .cse2 (< .cse34 .cse0) (<= .cse0 .cse37)) (or .cse2 (< .cse12 .cse0) (<= .cse0 .cse28)) (or .cse2 (< .cse37 .cse0) (<= .cse0 .cse38)) (or .cse2 (< .cse13 .cse0)) (or (<= .cse0 .cse22) .cse2 (< .cse38 .cse0)) (or (<= .cse0 .cse30) .cse2 (< .cse32 .cse0)) (or (< .cse35 .cse0) .cse2 (<= .cse0 .cse33)) (or .cse2 (< .cse16 .cse0)) (or (< .cse39 .cse0) .cse2 (<= .cse0 .cse36)) (or (<= .cse0 .cse29) .cse2 (< .cse1 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 44) 4294967296) .cse0) .cse2 (<= .cse0 .cse39)) (or (<= .cse0 .cse40) .cse2 (< .cse23 .cse0)) (or (< .cse40 .cse0) .cse2))) is different from false [2021-11-20 06:21:42,668 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse8 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse9 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse36 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse21 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse37 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296)) (.cse34 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse35 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse38 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse39 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< .cse7 .cse0)) (or (<= .cse0 .cse8) .cse2 (< .cse9 .cse0)) (or .cse2 (<= .cse0 .cse10) (< .cse11 .cse0)) (or (<= .cse0 .cse12) (< .cse13 .cse0) .cse2) (or (< .cse14 .cse0) .cse2 (<= .cse0 .cse15)) (or (< .cse16 .cse0) .cse2 (<= .cse0 .cse17)) (or .cse2 (<= .cse0 .cse18) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse18 .cse0)) (or (< .cse19 .cse0) .cse2 (<= .cse0 .cse20)) (or .cse2 (< .cse21 .cse0)) (or (<= .cse0 .cse7) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 42) 4294967296) .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse22) .cse2) (or (<= .cse0 .cse23) (< .cse24 .cse0) .cse2) (or .cse2 (< .cse25 .cse0)) (or .cse2 (<= .cse0 .cse16) (< (mod (+ 41 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (< .cse23 .cse0) .cse2 (<= .cse0 .cse25)) (or (< .cse17 .cse0) (<= .cse0 .cse26) .cse2) (or (<= .cse0 .cse11) .cse2 (< .cse27 .cse0)) (or .cse2 (< .cse28 .cse0)) (or (<= .cse0 .cse14) .cse2 (< .cse8 .cse0)) (or (< .cse29 .cse0) .cse2 (<= .cse0 .cse30)) (or .cse2 (< .cse20 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse30 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 43) 4294967296) .cse0) (<= .cse0 .cse31) .cse2) (or .cse2 (< .cse32 .cse0) (<= .cse0 .cse24)) (or (<= .cse0 .cse33) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse34)) (or .cse2 (< .cse35 .cse0) (<= .cse0 .cse9)) (or (<= .cse0 .cse13) (< .cse10 .cse0) .cse2) (or .cse2 (<= .cse0 .cse19) (< .cse26 .cse0)) (or .cse2 (< .cse33 .cse0) (<= .cse0 .cse36)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse27)) (or .cse2 (< .cse36 .cse0) (<= .cse0 .cse37)) (or .cse2 (< .cse12 .cse0)) (or (<= .cse0 .cse21) .cse2 (< .cse37 .cse0)) (or (<= .cse0 .cse29) .cse2 (< .cse31 .cse0)) (or (< .cse34 .cse0) .cse2 (<= .cse0 .cse32)) (or .cse2 (< .cse15 .cse0)) (or (< .cse38 .cse0) .cse2 (<= .cse0 .cse35)) (or (<= .cse0 .cse28) .cse2 (< .cse1 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 44) 4294967296) .cse0) .cse2 (<= .cse0 .cse38)) (or (<= .cse0 .cse39) .cse2 (< .cse22 .cse0)) (or (< .cse39 .cse0) .cse2))) is different from false [2021-11-20 06:21:44,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse8 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse9 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse36 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse21 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse37 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296)) (.cse34 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse35 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse38 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< .cse7 .cse0)) (or (<= .cse0 .cse8) .cse2 (< .cse9 .cse0)) (or .cse2 (<= .cse0 .cse10) (< .cse11 .cse0)) (or (<= .cse0 .cse12) (< .cse13 .cse0) .cse2) (or (< .cse14 .cse0) .cse2 (<= .cse0 .cse15)) (or (< .cse16 .cse0) .cse2 (<= .cse0 .cse17)) (or .cse2 (<= .cse0 .cse18) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse18 .cse0)) (or (< .cse19 .cse0) .cse2 (<= .cse0 .cse20)) (or .cse2 (< .cse21 .cse0)) (or (<= .cse0 .cse7) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 42) 4294967296) .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse22) .cse2) (or (<= .cse0 .cse23) (< .cse24 .cse0) .cse2) (or .cse2 (< .cse25 .cse0)) (or .cse2 (<= .cse0 .cse16) (< (mod (+ 41 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (< .cse23 .cse0) .cse2 (<= .cse0 .cse25)) (or (< .cse17 .cse0) (<= .cse0 .cse26) .cse2) (or (<= .cse0 .cse11) .cse2 (< .cse27 .cse0)) (or .cse2 (< .cse28 .cse0)) (or (<= .cse0 .cse14) .cse2 (< .cse8 .cse0)) (or (< .cse29 .cse0) .cse2 (<= .cse0 .cse30)) (or .cse2 (< .cse20 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse30 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 43) 4294967296) .cse0) (<= .cse0 .cse31) .cse2) (or .cse2 (< .cse32 .cse0) (<= .cse0 .cse24)) (or (<= .cse0 .cse33) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse34)) (or .cse2 (< .cse35 .cse0) (<= .cse0 .cse9)) (or (<= .cse0 .cse13) (< .cse10 .cse0) .cse2) (or .cse2 (<= .cse0 .cse19) (< .cse26 .cse0)) (or .cse2 (< .cse33 .cse0) (<= .cse0 .cse36)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse27)) (or .cse2 (< .cse36 .cse0) (<= .cse0 .cse37)) (or .cse2 (< .cse12 .cse0)) (or (<= .cse0 .cse21) .cse2 (< .cse37 .cse0)) (or (<= .cse0 .cse29) .cse2 (< .cse31 .cse0)) (or (< .cse34 .cse0) .cse2 (<= .cse0 .cse32)) (or .cse2 (< .cse15 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse35)) (or (<= .cse0 .cse28) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse38) .cse2 (< .cse22 .cse0)) (or (< .cse38 .cse0) .cse2))) is different from false [2021-11-20 06:21:46,729 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse8 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse9 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse35 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse21 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse36 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse33 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse34 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse37 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< .cse7 .cse0)) (or (<= .cse0 .cse8) .cse2 (< .cse9 .cse0)) (or .cse2 (<= .cse0 .cse10) (< .cse11 .cse0)) (or (<= .cse0 .cse12) (< .cse13 .cse0) .cse2) (or (< .cse14 .cse0) .cse2 (<= .cse0 .cse15)) (or (< .cse16 .cse0) .cse2 (<= .cse0 .cse17)) (or .cse2 (<= .cse0 .cse18) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse18 .cse0)) (or (< .cse19 .cse0) .cse2 (<= .cse0 .cse20)) (or .cse2 (< .cse21 .cse0)) (or (<= .cse0 .cse7) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 42) 4294967296) .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse22) .cse2) (or (<= .cse0 .cse23) (< .cse24 .cse0) .cse2) (or .cse2 (< .cse25 .cse0)) (or .cse2 (<= .cse0 .cse16) (< (mod (+ 41 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (< .cse23 .cse0) .cse2 (<= .cse0 .cse25)) (or (< .cse17 .cse0) (<= .cse0 .cse26) .cse2) (or (<= .cse0 .cse11) .cse2 (< .cse27 .cse0)) (or .cse2 (< .cse28 .cse0)) (or (<= .cse0 .cse14) .cse2 (< .cse8 .cse0)) (or (< .cse29 .cse0) .cse2 (<= .cse0 .cse30)) (or .cse2 (< .cse20 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse30 .cse0)) (or .cse2 (< .cse31 .cse0) (<= .cse0 .cse24)) (or (<= .cse0 .cse32) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse33)) (or .cse2 (< .cse34 .cse0) (<= .cse0 .cse9)) (or (<= .cse0 .cse13) (< .cse10 .cse0) .cse2) (or .cse2 (<= .cse0 .cse19) (< .cse26 .cse0)) (or .cse2 (< .cse32 .cse0) (<= .cse0 .cse35)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse27)) (or .cse2 (< .cse35 .cse0) (<= .cse0 .cse36)) (or .cse2 (< .cse12 .cse0)) (or (<= .cse0 .cse21) .cse2 (< .cse36 .cse0)) (or (<= .cse0 .cse29) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296) .cse0)) (or (< .cse33 .cse0) .cse2 (<= .cse0 .cse31)) (or .cse2 (< .cse15 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse34)) (or (<= .cse0 .cse28) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse37) .cse2 (< .cse22 .cse0)) (or (< .cse37 .cse0) .cse2))) is different from false [2021-11-20 06:21:48,762 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse8 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse9 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse34 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse20 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse35 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse32 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse36 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296) .cse0)) (or (<= .cse0 .cse7) .cse2 (< .cse8 .cse0)) (or .cse2 (<= .cse0 .cse9) (< .cse10 .cse0)) (or (<= .cse0 .cse11) (< .cse12 .cse0) .cse2) (or (< .cse13 .cse0) .cse2 (<= .cse0 .cse14)) (or (< .cse15 .cse0) .cse2 (<= .cse0 .cse16)) (or .cse2 (<= .cse0 .cse17) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse17 .cse0)) (or (< .cse18 .cse0) .cse2 (<= .cse0 .cse19)) (or .cse2 (< .cse20 .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse21) .cse2) (or (<= .cse0 .cse22) (< .cse23 .cse0) .cse2) (or .cse2 (< .cse24 .cse0)) (or .cse2 (<= .cse0 .cse15) (< (mod (+ 41 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (< .cse22 .cse0) .cse2 (<= .cse0 .cse24)) (or (< .cse16 .cse0) (<= .cse0 .cse25) .cse2) (or (<= .cse0 .cse10) .cse2 (< .cse26 .cse0)) (or .cse2 (< .cse27 .cse0)) (or (<= .cse0 .cse13) .cse2 (< .cse7 .cse0)) (or (< .cse28 .cse0) .cse2 (<= .cse0 .cse29)) (or .cse2 (< .cse19 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse29 .cse0)) (or .cse2 (< .cse30 .cse0) (<= .cse0 .cse23)) (or (<= .cse0 .cse31) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse32)) (or .cse2 (< .cse33 .cse0) (<= .cse0 .cse8)) (or (<= .cse0 .cse12) (< .cse9 .cse0) .cse2) (or .cse2 (<= .cse0 .cse18) (< .cse25 .cse0)) (or .cse2 (< .cse31 .cse0) (<= .cse0 .cse34)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse26)) (or .cse2 (< .cse34 .cse0) (<= .cse0 .cse35)) (or .cse2 (< .cse11 .cse0)) (or (<= .cse0 .cse20) .cse2 (< .cse35 .cse0)) (or (<= .cse0 .cse28) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296) .cse0)) (or (< .cse32 .cse0) .cse2 (<= .cse0 .cse30)) (or .cse2 (< .cse14 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse33)) (or (<= .cse0 .cse27) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse36) .cse2 (< .cse21 .cse0)) (or (< .cse36 .cse0) .cse2))) is different from false [2021-11-20 06:21:50,790 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse18 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse8 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse9 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse19 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse34 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse31 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse35 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296) .cse0)) (or (<= .cse0 .cse7) .cse2 (< .cse8 .cse0)) (or .cse2 (<= .cse0 .cse9) (< .cse10 .cse0)) (or (<= .cse0 .cse11) (< .cse12 .cse0) .cse2) (or (< .cse13 .cse0) .cse2 (<= .cse0 .cse14)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296) .cse0) .cse2 (<= .cse0 .cse15)) (or .cse2 (<= .cse0 .cse16) (< (mod (+ 40 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0)) (or (<= .cse0 .cse4) .cse2 (< .cse16 .cse0)) (or (< .cse17 .cse0) .cse2 (<= .cse0 .cse18)) (or .cse2 (< .cse19 .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse20) .cse2) (or (<= .cse0 .cse21) (< .cse22 .cse0) .cse2) (or .cse2 (< .cse23 .cse0)) (or (< .cse21 .cse0) .cse2 (<= .cse0 .cse23)) (or (< .cse15 .cse0) (<= .cse0 .cse24) .cse2) (or (<= .cse0 .cse10) .cse2 (< .cse25 .cse0)) (or .cse2 (< .cse26 .cse0)) (or (<= .cse0 .cse13) .cse2 (< .cse7 .cse0)) (or (< .cse27 .cse0) .cse2 (<= .cse0 .cse28)) (or .cse2 (< .cse18 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse28 .cse0)) (or .cse2 (< .cse29 .cse0) (<= .cse0 .cse22)) (or (<= .cse0 .cse30) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse31)) (or .cse2 (< .cse32 .cse0) (<= .cse0 .cse8)) (or (<= .cse0 .cse12) (< .cse9 .cse0) .cse2) (or .cse2 (<= .cse0 .cse17) (< .cse24 .cse0)) (or .cse2 (< .cse30 .cse0) (<= .cse0 .cse33)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse25)) (or .cse2 (< .cse33 .cse0) (<= .cse0 .cse34)) (or .cse2 (< .cse11 .cse0)) (or (<= .cse0 .cse19) .cse2 (< .cse34 .cse0)) (or (<= .cse0 .cse27) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296) .cse0)) (or (< .cse31 .cse0) .cse2 (<= .cse0 .cse29)) (or .cse2 (< .cse14 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse32)) (or (<= .cse0 .cse26) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse35) .cse2 (< .cse20 .cse0)) (or (< .cse35 .cse0) .cse2))) is different from false [2021-11-20 06:21:52,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse8 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse9 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse18 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse33 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse30 (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse34 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296) .cse0)) (or (<= .cse0 .cse7) .cse2 (< .cse8 .cse0)) (or .cse2 (<= .cse0 .cse9) (< .cse10 .cse0)) (or (<= .cse0 .cse11) (< .cse12 .cse0) .cse2) (or (< .cse13 .cse0) .cse2 (<= .cse0 .cse14)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296) .cse0) .cse2 (<= .cse0 .cse15)) (or (<= .cse0 .cse4) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296) .cse0)) (or (< .cse16 .cse0) .cse2 (<= .cse0 .cse17)) (or .cse2 (< .cse18 .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse19) .cse2) (or (<= .cse0 .cse20) (< .cse21 .cse0) .cse2) (or .cse2 (< .cse22 .cse0)) (or (< .cse20 .cse0) .cse2 (<= .cse0 .cse22)) (or (< .cse15 .cse0) (<= .cse0 .cse23) .cse2) (or (<= .cse0 .cse10) .cse2 (< .cse24 .cse0)) (or .cse2 (< .cse25 .cse0)) (or (<= .cse0 .cse13) .cse2 (< .cse7 .cse0)) (or (< .cse26 .cse0) .cse2 (<= .cse0 .cse27)) (or .cse2 (< .cse17 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse27 .cse0)) (or .cse2 (< .cse28 .cse0) (<= .cse0 .cse21)) (or (<= .cse0 .cse29) (< .cse6 .cse0) .cse2) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 39) 4294967296) .cse0) .cse2 (<= .cse0 .cse30)) (or .cse2 (< .cse31 .cse0) (<= .cse0 .cse8)) (or (<= .cse0 .cse12) (< .cse9 .cse0) .cse2) (or .cse2 (<= .cse0 .cse16) (< .cse23 .cse0)) (or .cse2 (< .cse29 .cse0) (<= .cse0 .cse32)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse24)) (or .cse2 (< .cse32 .cse0) (<= .cse0 .cse33)) (or .cse2 (< .cse11 .cse0)) (or (<= .cse0 .cse18) .cse2 (< .cse33 .cse0)) (or (<= .cse0 .cse26) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296) .cse0)) (or (< .cse30 .cse0) .cse2 (<= .cse0 .cse28)) (or .cse2 (< .cse14 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse31)) (or (<= .cse0 .cse25) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse34) .cse2 (< .cse19 .cse0)) (or (< .cse34 .cse0) .cse2))) is different from false [2021-11-20 06:21:54,843 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse8 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse9 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296)) (.cse31 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse18 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse32 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse33 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296) .cse0)) (or (<= .cse0 .cse7) .cse2 (< .cse8 .cse0)) (or .cse2 (<= .cse0 .cse9) (< .cse10 .cse0)) (or (<= .cse0 .cse11) (< .cse12 .cse0) .cse2) (or (< .cse13 .cse0) .cse2 (<= .cse0 .cse14)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296) .cse0) .cse2 (<= .cse0 .cse15)) (or (<= .cse0 .cse4) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296) .cse0)) (or (< .cse16 .cse0) .cse2 (<= .cse0 .cse17)) (or .cse2 (< .cse18 .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse19) .cse2) (or (<= .cse0 .cse20) (< .cse21 .cse0) .cse2) (or .cse2 (< .cse22 .cse0)) (or (< .cse20 .cse0) .cse2 (<= .cse0 .cse22)) (or (< .cse15 .cse0) (<= .cse0 .cse23) .cse2) (or (<= .cse0 .cse10) .cse2 (< .cse24 .cse0)) (or .cse2 (< .cse25 .cse0)) (or (<= .cse0 .cse13) .cse2 (< .cse7 .cse0)) (or (< .cse26 .cse0) .cse2 (<= .cse0 .cse27)) (or .cse2 (< .cse17 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse27 .cse0)) (or .cse2 (< .cse28 .cse0) (<= .cse0 .cse21)) (or (<= .cse0 .cse29) (< .cse6 .cse0) .cse2) (or .cse2 (< .cse30 .cse0) (<= .cse0 .cse8)) (or (<= .cse0 .cse12) (< .cse9 .cse0) .cse2) (or .cse2 (<= .cse0 .cse16) (< .cse23 .cse0)) (or .cse2 (< .cse29 .cse0) (<= .cse0 .cse31)) (or .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 38) 4294967296) .cse0) (<= .cse0 .cse24)) (or .cse2 (< .cse31 .cse0) (<= .cse0 .cse32)) (or .cse2 (< .cse11 .cse0)) (or (<= .cse0 .cse18) .cse2 (< .cse32 .cse0)) (or (<= .cse0 .cse26) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296) .cse0)) (or (< (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0) .cse2 (<= .cse0 .cse28)) (or .cse2 (< .cse14 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse30)) (or (<= .cse0 .cse25) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse33) .cse2 (< .cse19 .cse0)) (or (< .cse33 .cse0) .cse2))) is different from false [2021-11-20 06:21:56,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 26) 4294967296)) (.cse5 (mod (+ 19 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse20 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 11) 4294967296)) (.cse22 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 4) 4294967296)) (.cse15 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 27) 4294967296)) (.cse10 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 24) 4294967296)) (.cse13 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 9) 4294967296)) (.cse7 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 16) 4294967296)) (.cse17 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 6) 4294967296)) (.cse3 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 15) 4294967296)) (.cse26 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 22) 4294967296)) (.cse21 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 18) 4294967296)) (.cse6 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 28) 4294967296)) (.cse8 (mod (+ 23 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse12 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 10) 4294967296)) (.cse9 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 17) 4294967296)) (.cse16 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 13) 4294967296)) (.cse23 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 20) 4294967296)) (.cse28 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 21) 4294967296)) (.cse30 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 14) 4294967296)) (.cse11 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 3) 4294967296)) (.cse18 (mod |c_#Ultimate.C_memset_#t~loopctr1160| 4294967296)) (.cse31 (mod (+ 7 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296)) (.cse25 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 29) 4294967296)) (.cse27 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 25) 4294967296)) (.cse14 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 2) 4294967296)) (.cse29 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 30) 4294967296)) (.cse24 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 1) 4294967296)) (.cse1 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 8) 4294967296)) (.cse19 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 12) 4294967296)) (.cse32 (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 5) 4294967296)) (.cse0 (mod |c_#Ultimate.C_memset_#amount| 4294967296)) (.cse2 (not (= 305 |c_#Ultimate.C_memset_#amount|)))) (and (or (<= .cse0 .cse1) .cse2 (< .cse3 .cse0)) (or (< .cse4 .cse0) .cse2 (<= .cse0 .cse5)) (or (<= .cse0 .cse6) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 35) 4294967296) .cse0)) (or (<= .cse0 .cse7) .cse2 (< .cse8 .cse0)) (or .cse2 (<= .cse0 .cse9) (< .cse10 .cse0)) (or (<= .cse0 .cse11) (< .cse12 .cse0) .cse2) (or (< .cse13 .cse0) .cse2 (<= .cse0 .cse14)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 34) 4294967296) .cse0) .cse2 (<= .cse0 .cse15)) (or (<= .cse0 .cse4) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 33) 4294967296) .cse0)) (or (< .cse16 .cse0) .cse2 (<= .cse0 .cse17)) (or .cse2 (< .cse18 .cse0)) (or (< .cse5 .cse0) (<= .cse0 .cse19) .cse2) (or (<= .cse0 .cse20) (< .cse21 .cse0) .cse2) (or .cse2 (< .cse22 .cse0)) (or (< .cse20 .cse0) .cse2 (<= .cse0 .cse22)) (or (< .cse15 .cse0) (<= .cse0 .cse23) .cse2) (or (<= .cse0 .cse10) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 31) 4294967296) .cse0)) (or .cse2 (< .cse24 .cse0)) (or (<= .cse0 .cse13) .cse2 (< .cse7 .cse0)) (or (< .cse25 .cse0) .cse2 (<= .cse0 .cse26)) (or .cse2 (< .cse17 .cse0)) (or (<= .cse0 .cse3) .cse2 (< .cse26 .cse0)) (or .cse2 (< .cse27 .cse0) (<= .cse0 .cse21)) (or (<= .cse0 .cse28) (< .cse6 .cse0) .cse2) (or .cse2 (< .cse29 .cse0) (<= .cse0 .cse8)) (or (<= .cse0 .cse12) (< .cse9 .cse0) .cse2) (or .cse2 (<= .cse0 .cse16) (< .cse23 .cse0)) (or .cse2 (< .cse28 .cse0) (<= .cse0 .cse30)) (or .cse2 (< .cse30 .cse0) (<= .cse0 .cse31)) (or .cse2 (< .cse11 .cse0)) (or (<= .cse0 .cse18) .cse2 (< .cse31 .cse0)) (or (<= .cse0 .cse25) .cse2 (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 36) 4294967296) .cse0)) (or (< (mod (+ 32 |c_#Ultimate.C_memset_#t~loopctr1160|) 4294967296) .cse0) .cse2 (<= .cse0 .cse27)) (or .cse2 (< .cse14 .cse0)) (or (< (mod (+ |c_#Ultimate.C_memset_#t~loopctr1160| 37) 4294967296) .cse0) .cse2 (<= .cse0 .cse29)) (or (<= .cse0 .cse24) .cse2 (< .cse1 .cse0)) (or (<= .cse0 .cse32) .cse2 (< .cse19 .cse0)) (or (< .cse32 .cse0) .cse2))) is different from false