./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8 --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 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:45:55,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:45:55,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:45:55,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:45:55,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:45:55,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:45:55,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:45:55,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:45:55,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:45:55,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:45:55,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:45:55,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:45:55,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:45:55,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:45:55,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:45:55,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:45:55,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:45:55,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:45:55,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:45:55,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:45:55,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:45:55,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:45:55,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:45:55,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:45:55,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:45:55,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:45:55,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:45:55,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:45:55,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:45:55,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:45:55,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:45:55,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:45:55,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:45:55,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:45:55,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:45:55,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:45:55,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:45:55,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:45:55,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:45:55,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:45:55,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:45:55,696 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:45:55,744 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:45:55,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:45:55,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:45:55,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:45:55,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:45:55,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:45:55,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:45:55,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:45:55,748 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:45:55,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:45:55,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:45:55,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:45:55,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:45:55,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:45:55,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:45:55,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:45:55,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:45:55,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:45:55,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:45:55,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:45:55,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:45:55,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:45:55,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:45:55,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:45:55,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:45:55,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:45:55,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:45:55,754 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:45:55,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:45:55,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:45:55,755 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_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/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_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2022-11-16 12:45:56,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:45:56,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:45:56,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:45:56,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:45:56,044 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:45:56,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-11-16 12:45:56,115 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/c5291e9ab/5a9036dd4ef141039435ce98349715e3/FLAG02d530fdf [2022-11-16 12:45:56,941 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:45:56,942 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-11-16 12:45:56,977 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/c5291e9ab/5a9036dd4ef141039435ce98349715e3/FLAG02d530fdf [2022-11-16 12:45:57,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/c5291e9ab/5a9036dd4ef141039435ce98349715e3 [2022-11-16 12:45:57,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:45:57,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:45:57,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:45:57,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:45:57,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:45:57,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:45:57" (1/1) ... [2022-11-16 12:45:57,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6711d575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:57, skipping insertion in model container [2022-11-16 12:45:57,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:45:57" (1/1) ... [2022-11-16 12:45:57,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:45:57,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:45:58,888 WARN L229 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_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-11-16 12:45:58,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:45:58,928 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:45:59,325 WARN L229 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_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-11-16 12:45:59,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:45:59,488 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:45:59,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59 WrapperNode [2022-11-16 12:45:59,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:45:59,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:45:59,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:45:59,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:45:59,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,680 INFO L138 Inliner]: procedures = 157, calls = 812, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2775 [2022-11-16 12:45:59,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:45:59,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:45:59,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:45:59,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:45:59,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,854 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:45:59,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:45:59,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:45:59,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:45:59,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (1/1) ... [2022-11-16 12:45:59,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:45:59,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:45:59,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:45:59,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:45:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-16 12:45:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-11-16 12:45:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 12:45:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 12:45:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:45:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-16 12:45:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-16 12:45:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-11-16 12:45:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-11-16 12:45:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-11-16 12:45:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-11-16 12:45:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 12:45:59,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 12:45:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-11-16 12:45:59,974 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-11-16 12:45:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:45:59,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:45:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-16 12:45:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-16 12:45:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-11-16 12:45:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-11-16 12:45:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-16 12:45:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-16 12:45:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:45:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:45:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-11-16 12:45:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-11-16 12:45:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:45:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-16 12:45:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-16 12:45:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-11-16 12:45:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-11-16 12:45:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-16 12:45:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-16 12:45:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:45:59,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:45:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-16 12:45:59,978 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-16 12:45:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-16 12:45:59,978 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-16 12:45:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:45:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-11-16 12:45:59,978 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-11-16 12:45:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-11-16 12:45:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-11-16 12:45:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:45:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-16 12:45:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-16 12:45:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-11-16 12:45:59,980 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-11-16 12:45:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:45:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:45:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-16 12:45:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-11-16 12:45:59,981 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-11-16 12:45:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:45:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-16 12:45:59,983 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-16 12:45:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-11-16 12:45:59,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-11-16 12:45:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-16 12:45:59,985 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-16 12:45:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-11-16 12:45:59,985 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-11-16 12:45:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-11-16 12:45:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-11-16 12:45:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:45:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-11-16 12:45:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-11-16 12:45:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:45:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-11-16 12:45:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-11-16 12:45:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-11-16 12:45:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-11-16 12:45:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-16 12:45:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-16 12:45:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-16 12:45:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-16 12:45:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-16 12:45:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-16 12:45:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-16 12:45:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-16 12:45:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-16 12:45:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-16 12:45:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-16 12:45:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-16 12:45:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-16 12:45:59,990 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-16 12:45:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:45:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-16 12:45:59,991 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-16 12:45:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-11-16 12:45:59,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-11-16 12:45:59,991 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-11-16 12:45:59,992 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-11-16 12:45:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-16 12:45:59,993 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-16 12:45:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-16 12:45:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:45:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:45:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-11-16 12:45:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-11-16 12:45:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-16 12:45:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-16 12:46:00,548 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:46:00,550 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:46:03,400 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:46:03,415 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:46:03,415 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:46:03,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:03 BoogieIcfgContainer [2022-11-16 12:46:03,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:46:03,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:46:03,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:46:03,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:46:03,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:45:57" (1/3) ... [2022-11-16 12:46:03,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e848a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:03, skipping insertion in model container [2022-11-16 12:46:03,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:45:59" (2/3) ... [2022-11-16 12:46:03,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e848a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:03, skipping insertion in model container [2022-11-16 12:46:03,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:03" (3/3) ... [2022-11-16 12:46:03,434 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-11-16 12:46:03,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:46:03,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:46:03,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:46:03,566 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27ac6dca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:46:03,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:46:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 711 states have (on average 1.4303797468354431) internal successors, (1017), 738 states have internal predecessors, (1017), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-11-16 12:46:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:46:03,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:03,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:03,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2076921458, now seen corresponding path program 1 times [2022-11-16 12:46:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783542420] [2022-11-16 12:46:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:46:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:46:04,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:04,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783542420] [2022-11-16 12:46:04,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783542420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:04,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:04,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:46:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299770427] [2022-11-16 12:46:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:04,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:04,273 INFO L87 Difference]: Start difference. First operand has 963 states, 711 states have (on average 1.4303797468354431) internal successors, (1017), 738 states have internal predecessors, (1017), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:46:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:06,237 INFO L93 Difference]: Finished difference Result 1940 states and 2903 transitions. [2022-11-16 12:46:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-11-16 12:46:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:06,259 INFO L225 Difference]: With dead ends: 1940 [2022-11-16 12:46:06,259 INFO L226 Difference]: Without dead ends: 942 [2022-11-16 12:46:06,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:06,273 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 1568 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:06,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 1586 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 12:46:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-11-16 12:46:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 924. [2022-11-16 12:46:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 681 states have (on average 1.4199706314243759) internal successors, (967), 705 states have internal predecessors, (967), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:46:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1365 transitions. [2022-11-16 12:46:06,481 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1365 transitions. Word has length 59 [2022-11-16 12:46:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:06,482 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1365 transitions. [2022-11-16 12:46:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:46:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1365 transitions. [2022-11-16 12:46:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:46:06,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:06,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:06,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:46:06,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1794399116, now seen corresponding path program 1 times [2022-11-16 12:46:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:06,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773411359] [2022-11-16 12:46:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:46:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:46:06,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:06,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773411359] [2022-11-16 12:46:06,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773411359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:06,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:06,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664963666] [2022-11-16 12:46:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:06,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:06,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:06,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:06,706 INFO L87 Difference]: Start difference. First operand 924 states and 1365 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:46:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:09,006 INFO L93 Difference]: Finished difference Result 1849 states and 2738 transitions. [2022-11-16 12:46:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:46:09,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-11-16 12:46:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:09,016 INFO L225 Difference]: With dead ends: 1849 [2022-11-16 12:46:09,016 INFO L226 Difference]: Without dead ends: 942 [2022-11-16 12:46:09,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:09,021 INFO L413 NwaCegarLoop]: 933 mSDtfsCounter, 420 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:09,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 3117 Invalid, 1907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [150 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 12:46:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-11-16 12:46:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 924. [2022-11-16 12:46:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 681 states have (on average 1.4185022026431717) internal successors, (966), 705 states have internal predecessors, (966), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:46:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1364 transitions. [2022-11-16 12:46:09,075 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1364 transitions. Word has length 59 [2022-11-16 12:46:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:09,075 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1364 transitions. [2022-11-16 12:46:09,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:46:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1364 transitions. [2022-11-16 12:46:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:46:09,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:09,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:09,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:46:09,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 313703985, now seen corresponding path program 1 times [2022-11-16 12:46:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671445905] [2022-11-16 12:46:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:46:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:09,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671445905] [2022-11-16 12:46:09,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671445905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:09,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:09,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41590068] [2022-11-16 12:46:09,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:09,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:09,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:09,412 INFO L87 Difference]: Start difference. First operand 924 states and 1364 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-16 12:46:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:12,045 INFO L93 Difference]: Finished difference Result 1453 states and 2220 transitions. [2022-11-16 12:46:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:46:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-11-16 12:46:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:12,058 INFO L225 Difference]: With dead ends: 1453 [2022-11-16 12:46:12,059 INFO L226 Difference]: Without dead ends: 1451 [2022-11-16 12:46:12,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:12,070 INFO L413 NwaCegarLoop]: 1746 mSDtfsCounter, 1334 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 4902 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:12,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 4902 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-16 12:46:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-11-16 12:46:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 926. [2022-11-16 12:46:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 683 states have (on average 1.417276720351391) internal successors, (968), 707 states have internal predecessors, (968), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:46:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1366 transitions. [2022-11-16 12:46:12,171 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1366 transitions. Word has length 62 [2022-11-16 12:46:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:12,173 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 1366 transitions. [2022-11-16 12:46:12,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-16 12:46:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1366 transitions. [2022-11-16 12:46:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 12:46:12,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:12,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:12,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:46:12,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1325751679, now seen corresponding path program 1 times [2022-11-16 12:46:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:12,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530052958] [2022-11-16 12:46:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:46:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:46:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:12,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530052958] [2022-11-16 12:46:12,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530052958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:12,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:12,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447735783] [2022-11-16 12:46:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:12,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:12,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:12,490 INFO L87 Difference]: Start difference. First operand 926 states and 1366 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:46:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:15,332 INFO L93 Difference]: Finished difference Result 2362 states and 3564 transitions. [2022-11-16 12:46:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:46:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-11-16 12:46:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:15,343 INFO L225 Difference]: With dead ends: 2362 [2022-11-16 12:46:15,344 INFO L226 Difference]: Without dead ends: 1455 [2022-11-16 12:46:15,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:15,358 INFO L413 NwaCegarLoop]: 1416 mSDtfsCounter, 2188 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:15,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 2981 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 12:46:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2022-11-16 12:46:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 927. [2022-11-16 12:46:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 684 states have (on average 1.4166666666666667) internal successors, (969), 708 states have internal predecessors, (969), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:46:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1367 transitions. [2022-11-16 12:46:15,458 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1367 transitions. Word has length 72 [2022-11-16 12:46:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:15,459 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1367 transitions. [2022-11-16 12:46:15,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:46:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1367 transitions. [2022-11-16 12:46:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 12:46:15,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:15,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:15,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:46:15,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:15,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1244918688, now seen corresponding path program 1 times [2022-11-16 12:46:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:15,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387599595] [2022-11-16 12:46:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:46:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:15,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387599595] [2022-11-16 12:46:15,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387599595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:15,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:15,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:46:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170627159] [2022-11-16 12:46:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:15,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:46:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:15,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:46:15,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:15,803 INFO L87 Difference]: Start difference. First operand 927 states and 1367 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:46:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:19,994 INFO L93 Difference]: Finished difference Result 2228 states and 3463 transitions. [2022-11-16 12:46:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:46:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-11-16 12:46:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:20,006 INFO L225 Difference]: With dead ends: 2228 [2022-11-16 12:46:20,007 INFO L226 Difference]: Without dead ends: 2226 [2022-11-16 12:46:20,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:46:20,009 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 2576 mSDsluCounter, 5576 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 7815 SdHoareTripleChecker+Invalid, 3810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:20,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 7815 Invalid, 3810 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [767 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-16 12:46:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2022-11-16 12:46:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 929. [2022-11-16 12:46:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 685 states have (on average 1.416058394160584) internal successors, (970), 708 states have internal predecessors, (970), 200 states have call successors, (200), 43 states have call predecessors, (200), 43 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2022-11-16 12:46:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-11-16 12:46:20,098 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 74 [2022-11-16 12:46:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:20,100 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-11-16 12:46:20,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:46:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-11-16 12:46:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-16 12:46:20,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:20,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:20,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:46:20,107 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:20,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1953898069, now seen corresponding path program 1 times [2022-11-16 12:46:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:20,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693375351] [2022-11-16 12:46:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:46:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:46:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:46:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:46:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:46:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:20,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693375351] [2022-11-16 12:46:20,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693375351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:20,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:20,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:46:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614542588] [2022-11-16 12:46:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:20,374 INFO L87 Difference]: Start difference. First operand 929 states and 1370 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:46:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:22,333 INFO L93 Difference]: Finished difference Result 1886 states and 2774 transitions. [2022-11-16 12:46:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:46:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-11-16 12:46:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:22,339 INFO L225 Difference]: With dead ends: 1886 [2022-11-16 12:46:22,339 INFO L226 Difference]: Without dead ends: 976 [2022-11-16 12:46:22,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:22,344 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 1476 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:22,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 1526 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 12:46:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-11-16 12:46:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 949. [2022-11-16 12:46:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 699 states have (on average 1.407725321888412) internal successors, (984), 722 states have internal predecessors, (984), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-11-16 12:46:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1388 transitions. [2022-11-16 12:46:22,470 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1388 transitions. Word has length 104 [2022-11-16 12:46:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:22,470 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1388 transitions. [2022-11-16 12:46:22,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:46:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1388 transitions. [2022-11-16 12:46:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-16 12:46:22,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:22,479 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:22,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:46:22,480 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 181958863, now seen corresponding path program 1 times [2022-11-16 12:46:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:22,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276722967] [2022-11-16 12:46:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:46:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:46:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:46:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:46:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:46:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:22,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276722967] [2022-11-16 12:46:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276722967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:22,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:22,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:22,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556393617] [2022-11-16 12:46:22,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:22,820 INFO L87 Difference]: Start difference. First operand 949 states and 1388 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:46:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:25,671 INFO L93 Difference]: Finished difference Result 2399 states and 3599 transitions. [2022-11-16 12:46:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:46:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2022-11-16 12:46:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:25,681 INFO L225 Difference]: With dead ends: 2399 [2022-11-16 12:46:25,682 INFO L226 Difference]: Without dead ends: 1489 [2022-11-16 12:46:25,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:25,687 INFO L413 NwaCegarLoop]: 1468 mSDtfsCounter, 2011 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:25,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2281 Valid, 3069 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 12:46:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-11-16 12:46:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 953. [2022-11-16 12:46:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 703 states have (on average 1.406827880512091) internal successors, (989), 726 states have internal predecessors, (989), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-11-16 12:46:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1393 transitions. [2022-11-16 12:46:25,859 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1393 transitions. Word has length 106 [2022-11-16 12:46:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:25,861 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1393 transitions. [2022-11-16 12:46:25,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:46:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1393 transitions. [2022-11-16 12:46:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-16 12:46:25,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:25,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:25,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:46:25,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1351006426, now seen corresponding path program 1 times [2022-11-16 12:46:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:25,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051832817] [2022-11-16 12:46:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:25,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:25,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:46:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:46:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:46:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:46:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:46:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:26,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051832817] [2022-11-16 12:46:26,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051832817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:26,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:26,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:46:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694978429] [2022-11-16 12:46:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:26,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:26,072 INFO L87 Difference]: Start difference. First operand 953 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:46:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:27,741 INFO L93 Difference]: Finished difference Result 1895 states and 2791 transitions. [2022-11-16 12:46:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2022-11-16 12:46:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:27,746 INFO L225 Difference]: With dead ends: 1895 [2022-11-16 12:46:27,747 INFO L226 Difference]: Without dead ends: 981 [2022-11-16 12:46:27,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:27,750 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 416 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:27,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2305 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:46:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-11-16 12:46:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 953. [2022-11-16 12:46:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 703 states have (on average 1.402560455192034) internal successors, (986), 726 states have internal predecessors, (986), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-11-16 12:46:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1390 transitions. [2022-11-16 12:46:27,862 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1390 transitions. Word has length 109 [2022-11-16 12:46:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:27,862 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1390 transitions. [2022-11-16 12:46:27,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:46:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1390 transitions. [2022-11-16 12:46:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-16 12:46:27,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:27,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:46:27,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -465046881, now seen corresponding path program 1 times [2022-11-16 12:46:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981670267] [2022-11-16 12:46:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:46:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:46:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 12:46:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:46:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:46:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:28,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981670267] [2022-11-16 12:46:28,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981670267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:28,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065495229] [2022-11-16 12:46:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:28,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:28,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:46:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:28,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:46:28,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:46:28,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:46:29,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065495229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:29,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:29,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2022-11-16 12:46:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895927390] [2022-11-16 12:46:29,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:29,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:46:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:46:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:46:29,165 INFO L87 Difference]: Start difference. First operand 953 states and 1390 transitions. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 10 states have internal predecessors, (163), 4 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-16 12:46:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:34,819 INFO L93 Difference]: Finished difference Result 3919 states and 6042 transitions. [2022-11-16 12:46:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:46:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 10 states have internal predecessors, (163), 4 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 112 [2022-11-16 12:46:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:34,836 INFO L225 Difference]: With dead ends: 3919 [2022-11-16 12:46:34,837 INFO L226 Difference]: Without dead ends: 3005 [2022-11-16 12:46:34,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:46:34,878 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 6147 mSDsluCounter, 4047 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 1956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6562 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 6033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1956 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:34,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6562 Valid, 5563 Invalid, 6033 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1956 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-16 12:46:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2022-11-16 12:46:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 960. [2022-11-16 12:46:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 710 states have (on average 1.4014084507042253) internal successors, (995), 733 states have internal predecessors, (995), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-11-16 12:46:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1399 transitions. [2022-11-16 12:46:35,036 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1399 transitions. Word has length 112 [2022-11-16 12:46:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:35,036 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1399 transitions. [2022-11-16 12:46:35,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 10 states have internal predecessors, (163), 4 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-16 12:46:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1399 transitions. [2022-11-16 12:46:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 12:46:35,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:35,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:35,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:35,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:35,249 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1877320742, now seen corresponding path program 1 times [2022-11-16 12:46:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248295075] [2022-11-16 12:46:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:46:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:46:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:46:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:46:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:46:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 12:46:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:36,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248295075] [2022-11-16 12:46:36,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248295075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:36,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222872211] [2022-11-16 12:46:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:36,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:36,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:36,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:36,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:46:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:46:36,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:46:36,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:46:36,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222872211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:36,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:46:36,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-16 12:46:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377600165] [2022-11-16 12:46:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:36,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:36,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:36,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:46:36,939 INFO L87 Difference]: Start difference. First operand 960 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:46:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:37,633 INFO L93 Difference]: Finished difference Result 2653 states and 3987 transitions. [2022-11-16 12:46:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:37,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2022-11-16 12:46:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:37,643 INFO L225 Difference]: With dead ends: 2653 [2022-11-16 12:46:37,643 INFO L226 Difference]: Without dead ends: 1732 [2022-11-16 12:46:37,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:46:37,647 INFO L413 NwaCegarLoop]: 2095 mSDtfsCounter, 1176 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 5524 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:37,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 5524 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:46:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-11-16 12:46:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 962. [2022-11-16 12:46:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 712 states have (on average 1.4002808988764044) internal successors, (997), 735 states have internal predecessors, (997), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-11-16 12:46:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1401 transitions. [2022-11-16 12:46:37,817 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1401 transitions. Word has length 121 [2022-11-16 12:46:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:37,817 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1401 transitions. [2022-11-16 12:46:37,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:46:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1401 transitions. [2022-11-16 12:46:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-16 12:46:37,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:37,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:37,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:38,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:46:38,030 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:38,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1860512275, now seen corresponding path program 1 times [2022-11-16 12:46:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:38,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765340745] [2022-11-16 12:46:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:46:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 12:46:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:46:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:46:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 12:46:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:46:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:46:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:46:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:38,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765340745] [2022-11-16 12:46:38,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765340745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:38,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:38,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:46:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454478985] [2022-11-16 12:46:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:38,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:38,261 INFO L87 Difference]: Start difference. First operand 962 states and 1401 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:46:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:40,640 INFO L93 Difference]: Finished difference Result 2311 states and 3439 transitions. [2022-11-16 12:46:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:40,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2022-11-16 12:46:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:40,647 INFO L225 Difference]: With dead ends: 2311 [2022-11-16 12:46:40,647 INFO L226 Difference]: Without dead ends: 1388 [2022-11-16 12:46:40,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:40,651 INFO L413 NwaCegarLoop]: 1559 mSDtfsCounter, 830 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 3431 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:40,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 3431 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 12:46:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2022-11-16 12:46:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 964. [2022-11-16 12:46:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 714 states have (on average 1.3991596638655461) internal successors, (999), 737 states have internal predecessors, (999), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-11-16 12:46:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1403 transitions. [2022-11-16 12:46:40,839 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1403 transitions. Word has length 130 [2022-11-16 12:46:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:40,839 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1403 transitions. [2022-11-16 12:46:40,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:46:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1403 transitions. [2022-11-16 12:46:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-16 12:46:40,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:40,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:40,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:46:40,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 459180913, now seen corresponding path program 1 times [2022-11-16 12:46:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:40,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167984912] [2022-11-16 12:46:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:46:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:46:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:46:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:46:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:46:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:46:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-16 12:46:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-16 12:46:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:46:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:46:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:46:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167984912] [2022-11-16 12:46:42,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167984912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475849162] [2022-11-16 12:46:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:42,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:42,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:46:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 12:46:42,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 12:46:42,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:46:42,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475849162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:42,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:46:42,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 10 [2022-11-16 12:46:42,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226481839] [2022-11-16 12:46:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:46:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:46:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:46:42,732 INFO L87 Difference]: Start difference. First operand 964 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:46:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:43,256 INFO L93 Difference]: Finished difference Result 1910 states and 2795 transitions. [2022-11-16 12:46:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:46:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2022-11-16 12:46:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:43,263 INFO L225 Difference]: With dead ends: 1910 [2022-11-16 12:46:43,263 INFO L226 Difference]: Without dead ends: 972 [2022-11-16 12:46:43,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:46:43,268 INFO L413 NwaCegarLoop]: 1363 mSDtfsCounter, 42 mSDsluCounter, 9492 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10855 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:43,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10855 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:46:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-11-16 12:46:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 966. [2022-11-16 12:46:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 715 states have (on average 1.3986013986013985) internal successors, (1000), 739 states have internal predecessors, (1000), 202 states have call successors, (202), 47 states have call predecessors, (202), 48 states have return successors, (203), 200 states have call predecessors, (203), 202 states have call successors, (203) [2022-11-16 12:46:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1405 transitions. [2022-11-16 12:46:43,456 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1405 transitions. Word has length 138 [2022-11-16 12:46:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:43,457 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 1405 transitions. [2022-11-16 12:46:43,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:46:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1405 transitions. [2022-11-16 12:46:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-16 12:46:43,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:43,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:43,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:46:43,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:46:43,671 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1639772825, now seen corresponding path program 1 times [2022-11-16 12:46:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:43,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509386077] [2022-11-16 12:46:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:46:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 12:46:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:46:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 12:46:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:46:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:46:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 12:46:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-16 12:46:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 12:46:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 12:46:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:46:44,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:44,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509386077] [2022-11-16 12:46:44,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509386077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:44,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:44,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:46:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79792293] [2022-11-16 12:46:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:44,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:46:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:46:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:46:44,369 INFO L87 Difference]: Start difference. First operand 966 states and 1405 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:46:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:48,913 INFO L93 Difference]: Finished difference Result 2844 states and 4286 transitions. [2022-11-16 12:46:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:46:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2022-11-16 12:46:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:48,923 INFO L225 Difference]: With dead ends: 2844 [2022-11-16 12:46:48,923 INFO L226 Difference]: Without dead ends: 1919 [2022-11-16 12:46:48,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:46:48,926 INFO L413 NwaCegarLoop]: 1855 mSDtfsCounter, 1778 mSDsluCounter, 6539 mSDsCounter, 0 mSdLazyCounter, 3729 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 8394 SdHoareTripleChecker+Invalid, 4106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 3729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:48,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 8394 Invalid, 4106 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [377 Valid, 3729 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-16 12:46:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-11-16 12:46:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 971. [2022-11-16 12:46:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 719 states have (on average 1.3963838664812238) internal successors, (1004), 743 states have internal predecessors, (1004), 202 states have call successors, (202), 47 states have call predecessors, (202), 49 states have return successors, (207), 201 states have call predecessors, (207), 202 states have call successors, (207) [2022-11-16 12:46:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1413 transitions. [2022-11-16 12:46:49,119 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1413 transitions. Word has length 141 [2022-11-16 12:46:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:49,120 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 1413 transitions. [2022-11-16 12:46:49,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:46:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1413 transitions. [2022-11-16 12:46:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-16 12:46:49,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:49,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:49,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:46:49,125 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1450271979, now seen corresponding path program 2 times [2022-11-16 12:46:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:49,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689567871] [2022-11-16 12:46:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:46:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:46:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:46:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 12:46:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:46:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:46:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 12:46:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:46:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:46:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:46:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:46:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:46:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:46:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689567871] [2022-11-16 12:46:59,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689567871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263196766] [2022-11-16 12:46:59,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:46:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:59,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:59,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:47:41,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:47:41,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:47:41,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 185 conjunts are in the unsatisfiable core [2022-11-16 12:47:41,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:42,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:47:42,932 INFO L321 Elim1Store]: treesize reduction 133, result has 28.1 percent of original size [2022-11-16 12:47:42,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 60 [2022-11-16 12:47:43,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:47:43,457 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:47:43,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:47:43,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:47:44,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:47:44,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:47:44,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-16 12:47:44,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:47:44,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 12:47:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:47:45,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-16 12:47:45,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-16 12:47:45,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-11-16 12:47:45,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-11-16 12:47:45,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-11-16 12:47:45,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2022-11-16 12:47:45,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:47:45,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:47:45,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:47:45,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 12:47:45,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:45,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:47:45,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 12:47:45,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:45,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:47:45,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:47:45,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:45,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-16 12:47:46,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:47:46,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 12:47:46,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:47:46,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:47:46,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:47:46,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 12:47:47,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:47,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 102 [2022-11-16 12:47:47,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:47,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 71 [2022-11-16 12:47:47,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:47,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 30 [2022-11-16 12:47:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:47:47,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:48,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1254) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1253) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1255) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (< .cse0 1)))) is different from false [2022-11-16 12:47:48,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263196766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:48,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:47:48,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 59 [2022-11-16 12:47:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407736974] [2022-11-16 12:47:48,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-16 12:47:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:48,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-16 12:47:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3359, Unknown=1, NotChecked=116, Total=3660 [2022-11-16 12:47:48,110 INFO L87 Difference]: Start difference. First operand 971 states and 1413 transitions. Second operand has 59 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 49 states have internal predecessors, (206), 17 states have call successors, (30), 7 states have call predecessors, (30), 11 states have return successors, (29), 21 states have call predecessors, (29), 17 states have call successors, (29) [2022-11-16 12:48:05,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:07,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:30,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:43,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:45,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:47,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:55,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:57,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:48:59,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:01,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:03,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:06,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:08,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:12,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:16,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:18,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:20,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:22,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:24,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:26,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:28,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:47,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:49,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:52,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:53,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:56,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:49:59,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:01,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:05,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:09,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:11,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:13,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:15,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:18,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:19,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:22,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:24,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:27,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:50:40,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:51:18,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:51:20,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:51:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:42,499 INFO L93 Difference]: Finished difference Result 7897 states and 12407 transitions. [2022-11-16 12:51:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 12:51:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 49 states have internal predecessors, (206), 17 states have call successors, (30), 7 states have call predecessors, (30), 11 states have return successors, (29), 21 states have call predecessors, (29), 17 states have call successors, (29) Word has length 144 [2022-11-16 12:51:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:42,549 INFO L225 Difference]: With dead ends: 7897 [2022-11-16 12:51:42,550 INFO L226 Difference]: Without dead ends: 7895 [2022-11-16 12:51:42,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3774 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=923, Invalid=12420, Unknown=1, NotChecked=228, Total=13572 [2022-11-16 12:51:42,556 INFO L413 NwaCegarLoop]: 4404 mSDtfsCounter, 16267 mSDsluCounter, 100059 mSDsCounter, 0 mSdLazyCounter, 105803 mSolverCounterSat, 7941 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 213.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16635 SdHoareTripleChecker+Valid, 104463 SdHoareTripleChecker+Invalid, 122422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.9s SdHoareTripleChecker+Time, 7941 IncrementalHoareTripleChecker+Valid, 105803 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 8650 IncrementalHoareTripleChecker+Unchecked, 225.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:42,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16635 Valid, 104463 Invalid, 122422 Unknown, 0 Unchecked, 0.9s Time], IncrementalHoareTripleChecker [7941 Valid, 105803 Invalid, 28 Unknown, 8650 Unchecked, 225.0s Time] [2022-11-16 12:51:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7895 states. [2022-11-16 12:51:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7895 to 1829. [2022-11-16 12:51:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1348 states have (on average 1.3939169139465875) internal successors, (1879), 1399 states have internal predecessors, (1879), 387 states have call successors, (387), 90 states have call predecessors, (387), 93 states have return successors, (397), 377 states have call predecessors, (397), 387 states have call successors, (397) [2022-11-16 12:51:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2663 transitions. [2022-11-16 12:51:43,179 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2663 transitions. Word has length 144 [2022-11-16 12:51:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:43,180 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 2663 transitions. [2022-11-16 12:51:43,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 49 states have internal predecessors, (206), 17 states have call successors, (30), 7 states have call predecessors, (30), 11 states have return successors, (29), 21 states have call predecessors, (29), 17 states have call successors, (29) [2022-11-16 12:51:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2663 transitions. [2022-11-16 12:51:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-16 12:51:43,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:43,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:43,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:51:43,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 12:51:43,410 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:51:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1711362792, now seen corresponding path program 1 times [2022-11-16 12:51:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:43,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293366988] [2022-11-16 12:51:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:51:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:51:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:51:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:51:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:51:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:51:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-16 12:51:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 12:51:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:51:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:51:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 12:51:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 12:51:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:51:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:51:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:51:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 12:51:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:43,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293366988] [2022-11-16 12:51:43,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293366988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:43,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:51:43,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:51:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148313335] [2022-11-16 12:51:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:51:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:51:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:51:43,931 INFO L87 Difference]: Start difference. First operand 1829 states and 2663 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 12:51:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:51:47,098 INFO L93 Difference]: Finished difference Result 2794 states and 4082 transitions. [2022-11-16 12:51:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:51:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2022-11-16 12:51:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:51:47,107 INFO L225 Difference]: With dead ends: 2794 [2022-11-16 12:51:47,107 INFO L226 Difference]: Without dead ends: 1860 [2022-11-16 12:51:47,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:51:47,112 INFO L413 NwaCegarLoop]: 934 mSDtfsCounter, 419 mSDsluCounter, 3598 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:51:47,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 4532 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 12:51:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-11-16 12:51:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1825. [2022-11-16 12:51:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1345 states have (on average 1.3940520446096654) internal successors, (1875), 1396 states have internal predecessors, (1875), 386 states have call successors, (386), 90 states have call predecessors, (386), 93 states have return successors, (396), 376 states have call predecessors, (396), 386 states have call successors, (396) [2022-11-16 12:51:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2657 transitions. [2022-11-16 12:51:47,495 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2657 transitions. Word has length 148 [2022-11-16 12:51:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:51:47,495 INFO L495 AbstractCegarLoop]: Abstraction has 1825 states and 2657 transitions. [2022-11-16 12:51:47,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 12:51:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2657 transitions. [2022-11-16 12:51:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:51:47,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:51:47,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:51:47,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:51:47,554 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:51:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:51:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1414580562, now seen corresponding path program 1 times [2022-11-16 12:51:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:51:47,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453385546] [2022-11-16 12:51:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:51:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:51:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:51:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:51:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:51:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:51:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:51:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 12:51:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:51:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:51:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 12:51:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:51:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 12:51:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:51:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 12:51:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-16 12:51:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:51:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:51:49,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453385546] [2022-11-16 12:51:49,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453385546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:51:49,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506484533] [2022-11-16 12:51:49,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:51:49,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:51:49,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:51:49,799 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:51:49,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:51:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:51:52,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 12:51:52,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:51:53,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-11-16 12:51:53,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-16 12:51:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:51:53,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:51:53,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506484533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:51:53,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:51:53,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 17 [2022-11-16 12:51:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218829655] [2022-11-16 12:51:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:51:53,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:51:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:51:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:51:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:51:53,241 INFO L87 Difference]: Start difference. First operand 1825 states and 2657 transitions. Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 4 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 12:52:00,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:05,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:07,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:10,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:13,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:15,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:19,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:20,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:22,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:25,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:27,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:30,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:33,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:35,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:47,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:49,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:52:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:52:59,620 INFO L93 Difference]: Finished difference Result 9400 states and 14459 transitions. [2022-11-16 12:52:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 12:52:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 4 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 147 [2022-11-16 12:52:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:52:59,652 INFO L225 Difference]: With dead ends: 9400 [2022-11-16 12:52:59,653 INFO L226 Difference]: Without dead ends: 7615 [2022-11-16 12:52:59,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=1698, Unknown=0, NotChecked=0, Total=1980 [2022-11-16 12:52:59,660 INFO L413 NwaCegarLoop]: 2518 mSDtfsCounter, 8266 mSDsluCounter, 25157 mSDsCounter, 0 mSdLazyCounter, 15484 mSolverCounterSat, 3719 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8271 SdHoareTripleChecker+Valid, 27675 SdHoareTripleChecker+Invalid, 19213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3719 IncrementalHoareTripleChecker+Valid, 15484 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:52:59,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8271 Valid, 27675 Invalid, 19213 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3719 Valid, 15484 Invalid, 10 Unknown, 0 Unchecked, 61.4s Time] [2022-11-16 12:52:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2022-11-16 12:53:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 3041. [2022-11-16 12:53:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 2248 states have (on average 1.4070284697508897) internal successors, (3163), 2330 states have internal predecessors, (3163), 626 states have call successors, (626), 161 states have call predecessors, (626), 166 states have return successors, (660), 598 states have call predecessors, (660), 626 states have call successors, (660) [2022-11-16 12:53:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4449 transitions. [2022-11-16 12:53:00,648 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4449 transitions. Word has length 147 [2022-11-16 12:53:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:00,649 INFO L495 AbstractCegarLoop]: Abstraction has 3041 states and 4449 transitions. [2022-11-16 12:53:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 4 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 12:53:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4449 transitions. [2022-11-16 12:53:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-16 12:53:00,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:00,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:00,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:53:00,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:53:00,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -48504037, now seen corresponding path program 1 times [2022-11-16 12:53:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:00,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118408332] [2022-11-16 12:53:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:53:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:53:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:53:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:53:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:53:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:53:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 12:53:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:09,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:53:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:53:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 12:53:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:53:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:53:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:53:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:53:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:53:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:53:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-16 12:53:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 12:53:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118408332] [2022-11-16 12:53:10,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118408332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:10,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:10,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-11-16 12:53:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539929439] [2022-11-16 12:53:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:10,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 12:53:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 12:53:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2022-11-16 12:53:10,310 INFO L87 Difference]: Start difference. First operand 3041 states and 4449 transitions. Second operand has 32 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 27 states have internal predecessors, (109), 12 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 14 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-16 12:53:25,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:27,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:29,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:37,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:43,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:49,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:52,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:54,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:53:55,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:03,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:05,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:09,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:11,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:14,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:16,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:18,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:20,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:27,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:28,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:30,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:32,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:34,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:36,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:38,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:41,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:42,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:44,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:46,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:49,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:54:52,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:55:08,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:55:09,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:55:10,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:55:13,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:55:18,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:55:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:55:31,388 INFO L93 Difference]: Finished difference Result 9633 states and 15179 transitions. [2022-11-16 12:55:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 12:55:31,389 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 27 states have internal predecessors, (109), 12 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 14 states have call predecessors, (17), 12 states have call successors, (17) Word has length 152 [2022-11-16 12:55:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:55:31,425 INFO L225 Difference]: With dead ends: 9633 [2022-11-16 12:55:31,425 INFO L226 Difference]: Without dead ends: 9631 [2022-11-16 12:55:31,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=673, Invalid=4019, Unknown=0, NotChecked=0, Total=4692 [2022-11-16 12:55:31,430 INFO L413 NwaCegarLoop]: 4350 mSDtfsCounter, 10010 mSDsluCounter, 50161 mSDsCounter, 0 mSdLazyCounter, 47511 mSolverCounterSat, 8430 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10061 SdHoareTripleChecker+Valid, 54511 SdHoareTripleChecker+Invalid, 55967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.5s SdHoareTripleChecker+Time, 8430 IncrementalHoareTripleChecker+Valid, 47511 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 132.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:55:31,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10061 Valid, 54511 Invalid, 55967 Unknown, 0 Unchecked, 0.5s Time], IncrementalHoareTripleChecker [8430 Valid, 47511 Invalid, 26 Unknown, 0 Unchecked, 132.9s Time] [2022-11-16 12:55:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2022-11-16 12:55:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 3065. [2022-11-16 12:55:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 2265 states have (on average 1.405298013245033) internal successors, (3183), 2347 states have internal predecessors, (3183), 633 states have call successors, (633), 161 states have call predecessors, (633), 166 states have return successors, (668), 605 states have call predecessors, (668), 633 states have call successors, (668) [2022-11-16 12:55:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4484 transitions. [2022-11-16 12:55:32,513 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4484 transitions. Word has length 152 [2022-11-16 12:55:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:55:32,514 INFO L495 AbstractCegarLoop]: Abstraction has 3065 states and 4484 transitions. [2022-11-16 12:55:32,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 27 states have internal predecessors, (109), 12 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 14 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-16 12:55:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4484 transitions. [2022-11-16 12:55:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-16 12:55:32,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:55:32,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:55:32,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:55:32,526 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:55:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:55:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1181799274, now seen corresponding path program 1 times [2022-11-16 12:55:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:55:32,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82530027] [2022-11-16 12:55:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:55:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:55:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:55:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:55:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:55:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:55:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:55:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:55:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:55:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:55:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:55:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:55:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:55:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:55:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 12:55:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:55:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:55:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:55:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-16 12:55:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:55:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82530027] [2022-11-16 12:55:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82530027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:55:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161428377] [2022-11-16 12:55:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:55:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:55:32,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:55:32,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:55:32,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:55:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:33,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:55:33,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:55:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:55:33,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:55:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-16 12:55:33,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161428377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:55:33,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:55:33,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2022-11-16 12:55:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087852145] [2022-11-16 12:55:33,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:55:33,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:55:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:55:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:55:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:55:33,949 INFO L87 Difference]: Start difference. First operand 3065 states and 4484 transitions. Second operand has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 10 states have internal predecessors, (200), 7 states have call successors, (40), 4 states have call predecessors, (40), 3 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2022-11-16 12:55:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:55:43,026 INFO L93 Difference]: Finished difference Result 10131 states and 15395 transitions. [2022-11-16 12:55:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:55:43,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 10 states have internal predecessors, (200), 7 states have call successors, (40), 4 states have call predecessors, (40), 3 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) Word has length 156 [2022-11-16 12:55:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:55:43,053 INFO L225 Difference]: With dead ends: 10131 [2022-11-16 12:55:43,053 INFO L226 Difference]: Without dead ends: 7106 [2022-11-16 12:55:43,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:55:43,062 INFO L413 NwaCegarLoop]: 1404 mSDtfsCounter, 5145 mSDsluCounter, 4663 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 1557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5556 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 6348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1557 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:55:43,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5556 Valid, 6067 Invalid, 6348 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1557 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-16 12:55:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2022-11-16 12:55:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 3121. [2022-11-16 12:55:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2315 states have (on average 1.406047516198704) internal successors, (3255), 2397 states have internal predecessors, (3255), 639 states have call successors, (639), 161 states have call predecessors, (639), 166 states have return successors, (674), 611 states have call predecessors, (674), 639 states have call successors, (674) [2022-11-16 12:55:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4568 transitions. [2022-11-16 12:55:44,114 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4568 transitions. Word has length 156 [2022-11-16 12:55:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:55:44,115 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4568 transitions. [2022-11-16 12:55:44,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 10 states have internal predecessors, (200), 7 states have call successors, (40), 4 states have call predecessors, (40), 3 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2022-11-16 12:55:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4568 transitions. [2022-11-16 12:55:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-16 12:55:44,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:55:44,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:55:44,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:55:44,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:55:44,335 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:55:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:55:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash 63283275, now seen corresponding path program 1 times [2022-11-16 12:55:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:55:44,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765215511] [2022-11-16 12:55:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:55:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:55:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:55:44,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:55:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:55:45,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:55:45,090 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:55:45,092 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:55:45,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:55:45,101 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:55:45,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:55:45,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:55:45 BoogieIcfgContainer [2022-11-16 12:55:45,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:55:45,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:55:45,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:55:45,314 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:55:45,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:03" (3/4) ... [2022-11-16 12:55:45,317 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:55:45,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:55:45,318 INFO L158 Benchmark]: Toolchain (without parser) took 587868.72ms. Allocated memory was 109.1MB in the beginning and 952.1MB in the end (delta: 843.1MB). Free memory was 77.6MB in the beginning and 774.9MB in the end (delta: -697.3MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2022-11-16 12:55:45,319 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:55:45,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2040.14ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 77.3MB in the beginning and 78.2MB in the end (delta: -921.6kB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2022-11-16 12:55:45,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 189.55ms. Allocated memory is still 159.4MB. Free memory was 78.2MB in the beginning and 63.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 12:55:45,325 INFO L158 Benchmark]: Boogie Preprocessor took 201.05ms. Allocated memory is still 159.4MB. Free memory was 63.5MB in the beginning and 90.8MB in the end (delta: -27.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-11-16 12:55:45,326 INFO L158 Benchmark]: RCFGBuilder took 3534.92ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 90.8MB in the beginning and 141.8MB in the end (delta: -51.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2022-11-16 12:55:45,328 INFO L158 Benchmark]: TraceAbstraction took 581893.24ms. Allocated memory was 237.0MB in the beginning and 952.1MB in the end (delta: 715.1MB). Free memory was 140.8MB in the beginning and 774.9MB in the end (delta: -634.1MB). Peak memory consumption was 619.9MB. Max. memory is 16.1GB. [2022-11-16 12:55:45,329 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 952.1MB. Free memory is still 774.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:55:45,330 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2040.14ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 77.3MB in the beginning and 78.2MB in the end (delta: -921.6kB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 189.55ms. Allocated memory is still 159.4MB. Free memory was 78.2MB in the beginning and 63.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 201.05ms. Allocated memory is still 159.4MB. Free memory was 63.5MB in the beginning and 90.8MB in the end (delta: -27.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * RCFGBuilder took 3534.92ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 90.8MB in the beginning and 141.8MB in the end (delta: -51.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * TraceAbstraction took 581893.24ms. Allocated memory was 237.0MB in the beginning and 952.1MB in the end (delta: 715.1MB). Free memory was 140.8MB in the beginning and 774.9MB in the end (delta: -634.1MB). Peak memory consumption was 619.9MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 952.1MB. Free memory is still 774.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7129]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4873, overapproximation of shiftRight at line 4735, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6910] int LDV_IN_INTERRUPT ; [L5035] static int slip_maxdev = 256; [L5034] static struct net_device **slip_devs ; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L6939] CALL, EXPR dev_alloc_skb(1U) VAL [\old(arg0)=1, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(size)=243, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [\old(size)=243, \result={0:0}, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=0, size=243, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(arg0)=1, __this_module={4294967302:4294967304}, arg0=1, LDV_IN_INTERRUPT=0, ldv_malloc(sizeof(struct sk_buff))={0:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] RET, EXPR dev_alloc_skb(1U) VAL [__this_module={4294967302:4294967304}, dev_alloc_skb(1U)={0:0}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 [L6943] FCALL ldv_initialize() [L6944] FCALL ldv_handler_precall() VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group2={0:0}, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L6945] CALL, EXPR slip_init() [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4871] void *tmp ; VAL [\old(flags)=208, \old(size)=2048, __this_module={4294967302:4294967304}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] CALL, EXPR kmalloc(size, flags | 32768U) VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4862] void *tmp___2 ; [L4864] CALL, EXPR __kmalloc(size, flags) [L4857] CALL, EXPR ldv_malloc(size) VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ptr={-36893488147419103231:0}, ptr={-36893488147419103231:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={4294967302:4294967304}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [\old(size)=2048, \result={-36893488147419103231:0}, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, res={-36893488147419103231:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] RET, EXPR ldv_malloc(size) VAL [\old(size)=2048, \old(t)=32768, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-36893488147419103231:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, t=32768] [L4857] return ldv_malloc(size); [L4864] RET, EXPR __kmalloc(size, flags) [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [\old(flags)=32768, \old(size)=2048, \result={-36893488147419103231:0}, __this_module={4294967302:4294967304}, flags=32768, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-36893488147419103231:0}] [L4873] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=2048, __this_module={4294967302:4294967304}, flags=208, kmalloc(size, flags | 32768U)={-36893488147419103231:0}, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-36893488147419103231:0}, __this_module={4294967302:4294967304}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103231:0}] [L6740] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={-36893488147419103231:0}] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6747] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7287] return __VERIFIER_nondet_int(); [L6747] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, status=0, tmp={-36893488147419103231:0}] [L6753] return (status); VAL [\result=0, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, status=0, tmp={-36893488147419103231:0}] [L6945] RET, EXPR slip_init() [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=0, var_group2={0:0}, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=0, tmp___1=-2, var_group2={0:0}, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L7022] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L7023] FCALL ldv_handler_precall() VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={35:0}, var_group4={33:0}, var_group5={31:0}] [L7024] CALL ldv_slip_open_3(&var_group5) [L7117] ldv_func_ret_type___1 ldv_func_res ; [L7118] int tmp ; [L7120] CALL, EXPR slip_open(tty) [L6037] struct slip *sl ; [L6038] int err ; [L6039] int tmp ; [L6040] dev_t tmp___0 ; [L6041] struct task_struct *tmp___1 ; [L6042] int tmp___2 ; [L6044] CALL, EXPR capable(12) [L7172] return __VERIFIER_nondet_int(); [L6044] RET, EXPR capable(12) [L6044] tmp = capable(12) [L6045] COND FALSE !(tmp == 0) [L6049] EXPR tty->ops [L6049] EXPR (tty->ops)->write VAL [(tty->ops)->write={38:-37}, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={31:0}, tty={31:0}, tty->ops={4294967297:-3}] [L6049-L6051] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L6055] FCALL rtnl_lock() [L6056] CALL sl_sync() [L5925] int i ; [L5926] struct net_device *dev ; [L5927] struct slip *sl ; [L5928] void *tmp ; [L5930] i = 0 VAL [__this_module={4294967302:4294967304}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={4294967302:4294967304}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) VAL [__this_module={4294967302:4294967304}, dev={2497:-2496}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5938] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={4294967302:4294967304}, dev={2497:-2496}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [\result={2497:0}, __this_module={4294967302:4294967304}, dev={2497:-2496}, dev={2497:-2496}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5938] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={4294967302:4294967304}, dev={2497:-2496}, i=0, LDV_IN_INTERRUPT=1, netdev_priv((struct net_device const *)dev)={2497:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5938] tmp = netdev_priv((struct net_device const *)dev) [L5939] sl = (struct slip *)tmp [L5940] EXPR sl->tty [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [(unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U=1, __this_module={4294967302:4294967304}, dev={2497:-2496}, i=0, LDV_IN_INTERRUPT=1, sl={2497:0}, sl->tty={39:-38}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2497:0}] [L5940] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5949] i = i + 1 VAL [__this_module={4294967302:4294967304}, dev={2497:-2496}, i=1, LDV_IN_INTERRUPT=1, sl={2497:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2497:0}] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={4294967302:4294967304}, dev={2497:-2496}, i=1, LDV_IN_INTERRUPT=1, sl={2497:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2497:0}] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={4294967302:4294967304}, dev={0:0}, i=1, LDV_IN_INTERRUPT=1, sl={2497:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp={2497:0}] [L6056] RET sl_sync() [L6057] EXPR tty->disc_data [L6057] sl = (struct slip *)tty->disc_data [L6058] err = -17 [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6059] EXPR sl->magic [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [(unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250=0, __this_module={4294967302:4294967304}, err=-17, LDV_IN_INTERRUPT=1, sl={-41:42}, sl->magic=4294967299, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={31:0}, tty={31:0}] [L6059] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6063] err = -23 VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-41:42}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={31:0}, tty={31:0}] [L6064] CALL, EXPR tty_devnum(tty) VAL [__this_module={4294967302:4294967304}, arg0={31:0}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7276] return __VERIFIER_nondet_uint(); [L6064] RET, EXPR tty_devnum(tty) VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-41:42}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tty={31:0}, tty={31:0}, tty_devnum(tty)=4294967292] [L6064] tmp___0 = tty_devnum(tty) [L6065] CALL, EXPR sl_alloc(tmp___0) [L5961] int i ; [L5962] struct net_device *dev ; [L5963] struct slip *sl ; [L5964] void *tmp ; [L5965] int tmp___0 ; [L5966] char name[16U] ; [L5967] void *tmp___1 ; [L5968] struct lock_class_key __key ; [L5969] struct lock_class_key __key___0 ; [L5970] struct lock_class_key __key___1 ; [L5972] dev = 0 VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={0:0}, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5973] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5977] i = 0 VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L5985] i = i + 1 VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={2497:-2496}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={2497:-2496}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={0:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5992] COND FALSE !(i >= slip_maxdev) VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={0:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5996] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={0:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6008] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L6010] CALL, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L7168] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, ptr={-18446744073709551615:0}, ptr={-18446744073709551615:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={4294967302:4294967304}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [\old(size)=2255, \result={-18446744073709551615:0}, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, res={-18446744073709551615:0}, size=2255, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7168] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=472, \old(arg3)=1, \old(arg4)=1, __this_module={4294967302:4294967304}, arg0=472, arg1={43:0}, arg1={43:0}, arg2={-1:10}, arg2={-1:10}, arg3=1, arg4=1, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={-18446744073709551615:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7168] return ldv_malloc(sizeof(struct net_device)); [L6010] RET, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6010] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6011] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6015] dev->base_addr = (unsigned long )i VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6018] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [\result={-18446744073709551615:2496}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6018] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, netdev_priv((struct net_device const *)dev)={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6018] tmp___1 = netdev_priv((struct net_device const *)dev) [L6019] sl = (struct slip *)tmp___1 [L6020] sl->magic = 21250 [L6021] sl->dev = dev [L6022] CALL spinlock_check(& sl->lock) [L4778] return (& lock->ldv_5934.rlock); VAL [\result={-18446744073709551615:2516}, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, lock={-18446744073709551615:2516}, lock={-18446744073709551615:2516}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6022] RET spinlock_check(& sl->lock) [L6023] FCALL __raw_spin_lock_init(& sl->lock.ldv_5934.rlock, "&(&sl->lock)->rlock", & __key) [L6024] sl->mode = 8U VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6025] FCALL init_timer_key(& sl->keepalive_timer, "&sl->keepalive_timer", & __key___0) VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6026] sl->keepalive_timer.data = (unsigned long )sl [L6027] sl->keepalive_timer.function = & sl_keepalive VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6028] FCALL init_timer_key(& sl->outfill_timer, "&sl->outfill_timer", & __key___1) VAL [\old(line)=4294967292, __key={30:0}, __key___0={47:0}, __key___1={49:0}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, name={43:0}, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6029] sl->outfill_timer.data = (unsigned long )sl [L6030] sl->outfill_timer.function = & sl_outfill [L6031] *(slip_devs + (unsigned long )i) = dev [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); VAL [\old(line)=4294967292, \result={-18446744073709551615:2496}, __this_module={4294967302:4294967304}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967292, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6065] RET, EXPR sl_alloc(tmp___0) [L6065] sl = sl_alloc(tmp___0) [L6066] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6070] sl->tty = tty [L6071] tty->disc_data = (void *)sl VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tty={31:0}, tty={31:0}] [L6072] CALL, EXPR tty_devnum(tty) VAL [__this_module={4294967302:4294967304}, arg0={31:0}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7276] return __VERIFIER_nondet_uint(); [L6072] RET, EXPR tty_devnum(tty) VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tty={31:0}, tty={31:0}, tty_devnum(tty)=4294967300] [L6072] sl->line = tty_devnum(tty) [L6073] CALL, EXPR get_current() VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4746] struct task_struct *pfo_ret__ ; [L4749] case 1UL: [L4752] case 2UL: [L4755] case 4UL: [L4758] case 8UL: VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4765] return (pfo_ret__); VAL [\result={4294967308:-4}, __this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, pfo_ret__={4294967308:-4}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6073] RET, EXPR get_current() VAL [__this_module={4294967302:4294967304}, err=-23, get_current()={4294967308:-4}, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tty={31:0}, tty={31:0}] [L6073] tmp___1 = get_current() [L6074] EXPR tmp___1->pid [L6074] sl->pid = tmp___1->pid [L6075] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [\old(nr)=0, __this_module={4294967302:4294967304}, addr={-18446744073709551615:2668}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6075] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [__this_module={4294967302:4294967304}, constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags))=-7, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tmp___1={4294967308:-4}, tty={31:0}, tty={31:0}] [L6075] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6076] COND FALSE !(tmp___2 == 0) VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tmp___1={4294967308:-4}, tmp___2=-7, tty={31:0}, tty={31:0}] [L6090] EXPR sl->keepalive VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl->keepalive=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tmp___1={4294967308:-4}, tmp___2=-7, tty={31:0}, tty={31:0}] [L6090] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6095] EXPR sl->outfill VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl->outfill=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tmp___1={4294967308:-4}, tmp___2=-7, tty={31:0}, tty={31:0}] [L6095] COND FALSE !((unsigned int )sl->outfill != 0U) [L6100] FCALL rtnl_unlock() VAL [__this_module={4294967302:4294967304}, err=-23, LDV_IN_INTERRUPT=1, sl={-18446744073709551615:2496}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256, tmp=1, tmp___0=4294967292, tmp___1={4294967308:-4}, tmp___2=-7, tty={31:0}, tty={31:0}] [L6101] tty->receive_room = 65536U [L6102] EXPR sl->dev [L6102] EXPR (sl->dev)->base_addr [L6102] return ((int )(sl->dev)->base_addr); [L7120] RET, EXPR slip_open(tty) [L7120] tmp = slip_open(tty) [L7121] ldv_func_res = tmp [L7122] CALL ldv_check_callback_ret_val(ldv_func_res) [L7135] COND FALSE !(ret_val <= 0) [L7137] CALL ldv_error() [L7129] reach_error() VAL [__this_module={4294967302:4294967304}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 44 procedures, 963 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 581.6s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 488.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 64 mSolverCounterUnknown, 65032 SdHoareTripleChecker+Valid, 457.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62069 mSDsluCounter, 258316 SdHoareTripleChecker+Invalid, 431.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8650 IncrementalHoareTripleChecker+Unchecked, 225669 mSDsCounter, 27611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198114 IncrementalHoareTripleChecker+Invalid, 234439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27611 mSolverCounterUnsat, 32647 mSDtfsCounter, 198114 mSolverCounterSat, 2.2s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1481 SyntacticMatches, 19 SemanticMatches, 325 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5109 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3121occurred in iteration=18, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 28396 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 48.3s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 3010 NumberOfCodeBlocks, 3010 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3094 ConstructedInterpolants, 25 QuantifiedInterpolants, 12643 SizeOfPredicates, 84 NumberOfNonLiveVariables, 7079 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 403/431 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 12:55:45,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8 --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 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:55:47,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:55:47,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:55:47,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:55:47,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:55:47,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:55:47,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:55:47,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:55:47,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:55:47,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:55:47,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:55:47,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:55:47,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:55:47,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:55:47,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:55:47,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:55:47,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:55:47,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:55:47,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:55:47,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:55:47,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:55:47,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:55:47,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:55:47,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:55:47,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:55:47,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:55:47,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:55:47,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:55:47,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:55:47,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:55:47,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:55:47,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:55:47,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:55:47,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:55:47,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:55:47,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:55:47,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:55:47,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:55:47,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:55:47,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:55:47,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:55:47,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 12:55:47,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:55:47,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:55:47,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:55:47,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:55:47,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:55:47,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:55:47,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:55:47,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:55:47,892 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:55:47,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:55:47,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:55:47,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:55:47,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:55:47,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:55:47,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:55:47,895 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:55:47,895 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:55:47,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:55:47,896 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:55:47,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:55:47,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:55:47,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:55:47,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:55:47,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:55:47,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:55:47,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:55:47,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:55:47,898 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:55:47,898 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:55:47,899 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:55:47,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:55:47,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:55:47,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:55:47,900 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/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_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2022-11-16 12:55:48,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:55:48,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:55:48,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:55:48,355 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:55:48,358 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:55:48,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-11-16 12:55:48,440 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/060bf90fd/960c335377cf47858dca144da3cc8b9e/FLAGc0e2d386f [2022-11-16 12:55:49,376 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:55:49,377 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-11-16 12:55:49,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/060bf90fd/960c335377cf47858dca144da3cc8b9e/FLAGc0e2d386f [2022-11-16 12:55:49,845 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/data/060bf90fd/960c335377cf47858dca144da3cc8b9e [2022-11-16 12:55:49,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:55:49,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:55:49,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:55:49,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:55:49,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:55:49,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:55:49" (1/1) ... [2022-11-16 12:55:49,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9888b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:49, skipping insertion in model container [2022-11-16 12:55:49,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:55:49" (1/1) ... [2022-11-16 12:55:49,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:55:50,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:55:51,386 WARN L229 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_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-11-16 12:55:51,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:55:51,459 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:55:51,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:55:51,829 WARN L229 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_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-11-16 12:55:51,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:55:51,857 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:55:52,124 WARN L229 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_ce2ea969-9d5a-4974-bb22-78044de64552/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-11-16 12:55:52,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:55:52,257 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:55:52,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52 WrapperNode [2022-11-16 12:55:52,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:55:52,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:55:52,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:55:52,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:55:52,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,458 INFO L138 Inliner]: procedures = 170, calls = 812, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2683 [2022-11-16 12:55:52,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:55:52,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:55:52,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:55:52,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:55:52,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,781 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:55:52,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:55:52,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:55:52,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:55:52,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (1/1) ... [2022-11-16 12:55:52,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:55:52,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:55:52,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:55:52,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:55:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 12:55:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-16 12:55:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-11-16 12:55:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:55:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 12:55:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 12:55:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-16 12:55:52,924 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-16 12:55:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-11-16 12:55:52,925 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-11-16 12:55:52,925 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-11-16 12:55:52,925 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-11-16 12:55:52,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 12:55:52,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 12:55:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-11-16 12:55:52,926 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-11-16 12:55:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:55:52,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:55:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-16 12:55:52,927 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-16 12:55:52,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-11-16 12:55:52,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-11-16 12:55:52,927 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-11-16 12:55:52,927 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-11-16 12:55:52,927 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:55:52,928 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:55:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-11-16 12:55:52,928 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-11-16 12:55:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-11-16 12:55:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-11-16 12:55:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-16 12:55:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-11-16 12:55:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-16 12:55:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-16 12:55:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-11-16 12:55:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-11-16 12:55:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-16 12:55:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-16 12:55:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:55:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:55:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-16 12:55:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-16 12:55:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-16 12:55:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-16 12:55:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:55:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-11-16 12:55:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-11-16 12:55:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-11-16 12:55:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-11-16 12:55:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:55:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-16 12:55:52,933 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-16 12:55:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-11-16 12:55:52,933 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-11-16 12:55:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:55:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:55:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-16 12:55:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-11-16 12:55:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-11-16 12:55:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-11-16 12:55:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-11-16 12:55:52,935 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-11-16 12:55:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:55:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-16 12:55:52,935 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-16 12:55:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-16 12:55:52,935 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-16 12:55:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-11-16 12:55:52,936 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-11-16 12:55:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2022-11-16 12:55:52,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2022-11-16 12:55:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-11-16 12:55:52,937 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-11-16 12:55:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-16 12:55:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-16 12:55:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-16 12:55:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-11-16 12:55:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-11-16 12:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:55:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-11-16 12:55:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-11-16 12:55:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-11-16 12:55:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-11-16 12:55:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-16 12:55:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-16 12:55:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:55:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 12:55:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-16 12:55:52,940 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-16 12:55:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-16 12:55:52,940 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-16 12:55:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-16 12:55:52,941 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-16 12:55:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-16 12:55:52,941 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-16 12:55:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-16 12:55:52,941 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-16 12:55:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-16 12:55:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-16 12:55:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-11-16 12:55:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-16 12:55:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-16 12:55:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-11-16 12:55:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-11-16 12:55:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-11-16 12:55:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-11-16 12:55:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-16 12:55:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-16 12:55:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:55:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:55:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-11-16 12:55:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-11-16 12:55:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-16 12:55:52,945 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-16 12:55:53,635 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:55:53,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:56:14,687 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:56:14,716 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:56:14,716 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:56:14,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:56:14 BoogieIcfgContainer [2022-11-16 12:56:14,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:56:14,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:56:14,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:56:14,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:56:14,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:55:49" (1/3) ... [2022-11-16 12:56:14,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae22943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:56:14, skipping insertion in model container [2022-11-16 12:56:14,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:52" (2/3) ... [2022-11-16 12:56:14,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae22943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:56:14, skipping insertion in model container [2022-11-16 12:56:14,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:56:14" (3/3) ... [2022-11-16 12:56:14,750 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-11-16 12:56:14,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:56:14,781 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:56:14,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:56:14,890 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ad204aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:56:14,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:56:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 961 states, 709 states have (on average 1.4287729196050776) internal successors, (1013), 736 states have internal predecessors, (1013), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-11-16 12:56:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:56:14,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:14,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:14,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash -409076956, now seen corresponding path program 1 times [2022-11-16 12:56:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690104381] [2022-11-16 12:56:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:14,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:14,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:15,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:56:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:15,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:56:15,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:56:15,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:15,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:15,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690104381] [2022-11-16 12:56:15,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690104381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:15,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:15,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:56:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173958615] [2022-11-16 12:56:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:15,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:56:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:56:15,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:56:15,920 INFO L87 Difference]: Start difference. First operand has 961 states, 709 states have (on average 1.4287729196050776) internal successors, (1013), 736 states have internal predecessors, (1013), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:56:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:16,137 INFO L93 Difference]: Finished difference Result 1918 states and 2864 transitions. [2022-11-16 12:56:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:56:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-11-16 12:56:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:16,164 INFO L225 Difference]: With dead ends: 1918 [2022-11-16 12:56:16,164 INFO L226 Difference]: Without dead ends: 922 [2022-11-16 12:56:16,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:56:16,178 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 1405 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:16,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 1411 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:56:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-11-16 12:56:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2022-11-16 12:56:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 679 states have (on average 1.4182621502209132) internal successors, (963), 703 states have internal predecessors, (963), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:56:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1361 transitions. [2022-11-16 12:56:16,375 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1361 transitions. Word has length 59 [2022-11-16 12:56:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:16,376 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1361 transitions. [2022-11-16 12:56:16,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:56:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1361 transitions. [2022-11-16 12:56:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:56:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:16,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:16,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:16,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:16,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 14569766, now seen corresponding path program 1 times [2022-11-16 12:56:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:16,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838799199] [2022-11-16 12:56:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:16,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:16,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:16,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:56:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:17,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:56:17,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:56:17,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:17,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:17,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838799199] [2022-11-16 12:56:17,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838799199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:17,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:17,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:56:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965061587] [2022-11-16 12:56:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:17,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:56:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:56:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:17,295 INFO L87 Difference]: Start difference. First operand 922 states and 1361 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:56:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:17,500 INFO L93 Difference]: Finished difference Result 1827 states and 2699 transitions. [2022-11-16 12:56:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:56:17,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-11-16 12:56:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:17,510 INFO L225 Difference]: With dead ends: 1827 [2022-11-16 12:56:17,511 INFO L226 Difference]: Without dead ends: 922 [2022-11-16 12:56:17,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:56:17,516 INFO L413 NwaCegarLoop]: 1360 mSDtfsCounter, 1 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:17,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4075 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:56:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-11-16 12:56:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2022-11-16 12:56:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 679 states have (on average 1.4167893961708395) internal successors, (962), 703 states have internal predecessors, (962), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-11-16 12:56:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1360 transitions. [2022-11-16 12:56:17,619 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1360 transitions. Word has length 59 [2022-11-16 12:56:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:17,620 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1360 transitions. [2022-11-16 12:56:17,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:56:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1360 transitions. [2022-11-16 12:56:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 12:56:17,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:17,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:17,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:17,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:17,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1156177197, now seen corresponding path program 1 times [2022-11-16 12:56:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:17,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483357889] [2022-11-16 12:56:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:17,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:17,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:17,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:17,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:56:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:18,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:56:18,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:56:18,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:18,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:18,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483357889] [2022-11-16 12:56:18,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483357889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:18,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:18,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:56:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437258977] [2022-11-16 12:56:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:18,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:56:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:56:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:56:18,788 INFO L87 Difference]: Start difference. First operand 922 states and 1360 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:56:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:20,422 INFO L93 Difference]: Finished difference Result 1866 states and 2747 transitions. [2022-11-16 12:56:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:56:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2022-11-16 12:56:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:20,431 INFO L225 Difference]: With dead ends: 1866 [2022-11-16 12:56:20,431 INFO L226 Difference]: Without dead ends: 950 [2022-11-16 12:56:20,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:56:20,437 INFO L413 NwaCegarLoop]: 1360 mSDtfsCounter, 42 mSDsluCounter, 9470 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10830 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:20,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10830 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 12:56:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-11-16 12:56:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 944. [2022-11-16 12:56:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 694 states have (on average 1.4092219020172911) internal successors, (978), 719 states have internal predecessors, (978), 201 states have call successors, (201), 47 states have call predecessors, (201), 48 states have return successors, (202), 199 states have call predecessors, (202), 201 states have call successors, (202) [2022-11-16 12:56:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1381 transitions. [2022-11-16 12:56:20,513 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1381 transitions. Word has length 62 [2022-11-16 12:56:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:20,516 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1381 transitions. [2022-11-16 12:56:20,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-16 12:56:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1381 transitions. [2022-11-16 12:56:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:56:20,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:20,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:20,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:20,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:20,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1594030711, now seen corresponding path program 1 times [2022-11-16 12:56:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361173700] [2022-11-16 12:56:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:20,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:20,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:56:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:21,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:56:21,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:56:21,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:21,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361173700] [2022-11-16 12:56:21,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361173700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:21,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:21,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:56:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782650325] [2022-11-16 12:56:21,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:21,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:56:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:56:21,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:21,293 INFO L87 Difference]: Start difference. First operand 944 states and 1381 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-16 12:56:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:22,140 INFO L93 Difference]: Finished difference Result 1455 states and 2196 transitions. [2022-11-16 12:56:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:56:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 65 [2022-11-16 12:56:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:22,151 INFO L225 Difference]: With dead ends: 1455 [2022-11-16 12:56:22,152 INFO L226 Difference]: Without dead ends: 1453 [2022-11-16 12:56:22,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:56:22,154 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 915 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 5328 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:22,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 5328 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:56:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-11-16 12:56:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 946. [2022-11-16 12:56:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 696 states have (on average 1.4080459770114941) internal successors, (980), 721 states have internal predecessors, (980), 201 states have call successors, (201), 47 states have call predecessors, (201), 48 states have return successors, (202), 199 states have call predecessors, (202), 201 states have call successors, (202) [2022-11-16 12:56:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1383 transitions. [2022-11-16 12:56:22,279 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1383 transitions. Word has length 65 [2022-11-16 12:56:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:22,281 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1383 transitions. [2022-11-16 12:56:22,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-16 12:56:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1383 transitions. [2022-11-16 12:56:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 12:56:22,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:22,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:22,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:22,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:22,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2133834646, now seen corresponding path program 1 times [2022-11-16 12:56:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:22,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979177063] [2022-11-16 12:56:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:22,505 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:22,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:56:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:22,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:56:22,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:56:22,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:22,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:22,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979177063] [2022-11-16 12:56:22,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979177063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:22,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:56:22,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735558347] [2022-11-16 12:56:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:22,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:56:22,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:22,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:56:22,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:22,980 INFO L87 Difference]: Start difference. First operand 946 states and 1383 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-16 12:56:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:23,831 INFO L93 Difference]: Finished difference Result 1458 states and 2199 transitions. [2022-11-16 12:56:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:56:23,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 66 [2022-11-16 12:56:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:23,845 INFO L225 Difference]: With dead ends: 1458 [2022-11-16 12:56:23,845 INFO L226 Difference]: Without dead ends: 1456 [2022-11-16 12:56:23,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:56:23,849 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 915 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 5336 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:23,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 5336 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:56:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-11-16 12:56:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 946. [2022-11-16 12:56:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 696 states have (on average 1.4080459770114941) internal successors, (980), 721 states have internal predecessors, (980), 201 states have call successors, (201), 47 states have call predecessors, (201), 48 states have return successors, (202), 199 states have call predecessors, (202), 201 states have call successors, (202) [2022-11-16 12:56:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1383 transitions. [2022-11-16 12:56:23,964 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1383 transitions. Word has length 66 [2022-11-16 12:56:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:23,964 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1383 transitions. [2022-11-16 12:56:23,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-16 12:56:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1383 transitions. [2022-11-16 12:56:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 12:56:23,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:23,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:23,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:24,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:24,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2126255121, now seen corresponding path program 1 times [2022-11-16 12:56:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:24,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202061911] [2022-11-16 12:56:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:24,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:24,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:24,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:24,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:56:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:24,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:56:24,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:56:24,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:24,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:24,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202061911] [2022-11-16 12:56:24,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202061911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:24,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:25,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:56:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866105472] [2022-11-16 12:56:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:25,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:56:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:56:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:25,006 INFO L87 Difference]: Start difference. First operand 946 states and 1383 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:56:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:29,014 INFO L93 Difference]: Finished difference Result 2362 states and 3536 transitions. [2022-11-16 12:56:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:56:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2022-11-16 12:56:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:29,024 INFO L225 Difference]: With dead ends: 2362 [2022-11-16 12:56:29,024 INFO L226 Difference]: Without dead ends: 1457 [2022-11-16 12:56:29,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:29,029 INFO L413 NwaCegarLoop]: 1845 mSDtfsCounter, 1835 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1973 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:29,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1973 Valid, 2795 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-16 12:56:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-11-16 12:56:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 947. [2022-11-16 12:56:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 697 states have (on average 1.4074605451936872) internal successors, (981), 722 states have internal predecessors, (981), 201 states have call successors, (201), 47 states have call predecessors, (201), 48 states have return successors, (202), 199 states have call predecessors, (202), 201 states have call successors, (202) [2022-11-16 12:56:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1384 transitions. [2022-11-16 12:56:29,197 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1384 transitions. Word has length 75 [2022-11-16 12:56:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:29,197 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1384 transitions. [2022-11-16 12:56:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:56:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1384 transitions. [2022-11-16 12:56:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:56:29,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:29,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:29,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:29,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:29,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1326022320, now seen corresponding path program 1 times [2022-11-16 12:56:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:29,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658832684] [2022-11-16 12:56:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:29,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:29,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:29,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:56:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:29,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:56:29,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:56:29,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:29,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658832684] [2022-11-16 12:56:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658832684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:29,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:29,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:56:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778494489] [2022-11-16 12:56:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:29,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:56:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:56:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:56:29,975 INFO L87 Difference]: Start difference. First operand 947 states and 1384 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:56:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:31,017 INFO L93 Difference]: Finished difference Result 1464 states and 2207 transitions. [2022-11-16 12:56:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:56:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2022-11-16 12:56:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:31,033 INFO L225 Difference]: With dead ends: 1464 [2022-11-16 12:56:31,033 INFO L226 Difference]: Without dead ends: 1462 [2022-11-16 12:56:31,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:56:31,036 INFO L413 NwaCegarLoop]: 2169 mSDtfsCounter, 1299 mSDsluCounter, 4827 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 6996 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:31,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 6996 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:56:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-11-16 12:56:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 949. [2022-11-16 12:56:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 698 states have (on average 1.4068767908309456) internal successors, (982), 723 states have internal predecessors, (982), 202 states have call successors, (202), 47 states have call predecessors, (202), 48 states have return successors, (203), 200 states have call predecessors, (203), 202 states have call successors, (203) [2022-11-16 12:56:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1387 transitions. [2022-11-16 12:56:31,181 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1387 transitions. Word has length 77 [2022-11-16 12:56:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:31,184 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1387 transitions. [2022-11-16 12:56:31,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:56:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1387 transitions. [2022-11-16 12:56:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-16 12:56:31,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:31,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:31,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:31,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:31,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 523121960, now seen corresponding path program 1 times [2022-11-16 12:56:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:31,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906078230] [2022-11-16 12:56:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:31,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:31,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:31,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:31,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:56:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:31,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:56:31,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:56:32,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:32,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:32,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906078230] [2022-11-16 12:56:32,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906078230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:32,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:32,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:56:32,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418405619] [2022-11-16 12:56:32,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:32,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:56:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:56:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:56:32,265 INFO L87 Difference]: Start difference. First operand 949 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:56:33,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:56:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:33,861 INFO L93 Difference]: Finished difference Result 1857 states and 2729 transitions. [2022-11-16 12:56:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:56:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2022-11-16 12:56:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:33,883 INFO L225 Difference]: With dead ends: 1857 [2022-11-16 12:56:33,883 INFO L226 Difference]: Without dead ends: 949 [2022-11-16 12:56:33,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:56:33,892 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 1305 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:33,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1396 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 12:56:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-11-16 12:56:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2022-11-16 12:56:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 698 states have (on average 1.4054441260744985) internal successors, (981), 723 states have internal predecessors, (981), 202 states have call successors, (202), 47 states have call predecessors, (202), 48 states have return successors, (203), 200 states have call predecessors, (203), 202 states have call successors, (203) [2022-11-16 12:56:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1386 transitions. [2022-11-16 12:56:34,099 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1386 transitions. Word has length 85 [2022-11-16 12:56:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:34,099 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1386 transitions. [2022-11-16 12:56:34,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:56:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1386 transitions. [2022-11-16 12:56:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-16 12:56:34,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:34,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:34,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:34,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:34,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 596960674, now seen corresponding path program 1 times [2022-11-16 12:56:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:34,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709320738] [2022-11-16 12:56:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:34,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:34,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:34,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:34,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:56:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:34,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:56:34,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:56:35,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:35,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709320738] [2022-11-16 12:56:35,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709320738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:35,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:35,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:56:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943154054] [2022-11-16 12:56:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:35,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:56:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:56:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:35,229 INFO L87 Difference]: Start difference. First operand 949 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:56:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:39,433 INFO L93 Difference]: Finished difference Result 2370 states and 3544 transitions. [2022-11-16 12:56:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:56:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-11-16 12:56:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:39,442 INFO L225 Difference]: With dead ends: 2370 [2022-11-16 12:56:39,443 INFO L226 Difference]: Without dead ends: 1462 [2022-11-16 12:56:39,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:56:39,446 INFO L413 NwaCegarLoop]: 1913 mSDtfsCounter, 2042 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:39,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2858 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-16 12:56:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-11-16 12:56:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 953. [2022-11-16 12:56:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 702 states have (on average 1.4045584045584045) internal successors, (986), 727 states have internal predecessors, (986), 202 states have call successors, (202), 47 states have call predecessors, (202), 48 states have return successors, (203), 200 states have call predecessors, (203), 202 states have call successors, (203) [2022-11-16 12:56:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1391 transitions. [2022-11-16 12:56:39,617 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1391 transitions. Word has length 87 [2022-11-16 12:56:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:39,617 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1391 transitions. [2022-11-16 12:56:39,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:56:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1391 transitions. [2022-11-16 12:56:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-16 12:56:39,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:39,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:39,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:39,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:39,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:56:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash -272015955, now seen corresponding path program 1 times [2022-11-16 12:56:39,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:39,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717328901] [2022-11-16 12:56:39,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:56:39,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:39,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:39,836 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:39,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ea969-9d5a-4974-bb22-78044de64552/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:56:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:56:40,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:56:40,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:40,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2022-11-16 12:56:40,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2022-11-16 12:56:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:56:40,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:56:40,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:56:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717328901] [2022-11-16 12:56:40,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717328901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:56:40,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:56:40,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:56:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234187005] [2022-11-16 12:56:40,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:56:40,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:56:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:56:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:56:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:56:40,883 INFO L87 Difference]: Start difference. First operand 953 states and 1391 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:56:48,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:00,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:02,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:04,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:12,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:16,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:19,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:22,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:23,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:33,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:35,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:37,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:39,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:40,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:42,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:43,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:47,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:50,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:52,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:57:54,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:23,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:25,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:27,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:29,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:31,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:33,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:35,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:38,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:42,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:50,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:58:59,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:59:07,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:59:10,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:59:12,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:59:20,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:59:22,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:59:24,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []