./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- 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-b5237d8 [2022-11-21 16:10:37,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:10:37,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:10:37,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:10:37,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:10:37,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:10:37,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:10:37,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:10:37,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:10:37,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:10:37,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:10:37,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:10:37,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:10:37,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:10:37,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:10:37,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:10:37,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:10:37,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:10:37,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:10:37,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:10:37,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:10:37,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:10:37,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:10:37,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:10:37,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:10:37,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:10:37,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:10:37,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:10:37,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:10:37,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:10:37,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:10:37,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:10:37,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:10:37,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:10:37,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:10:37,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:10:37,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:10:37,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:10:37,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:10:37,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:10:37,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:10:37,646 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-21 16:10:37,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:10:37,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:10:37,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:10:37,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:10:37,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:10:37,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:10:37,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:10:37,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:10:37,704 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:10:37,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:10:37,706 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:10:37,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:10:37,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:10:37,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:10:37,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:10:37,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:10:37,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:10:37,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:10:37,707 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 16:10:37,707 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:10:37,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:10:37,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:10:37,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:10:37,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:10:37,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:10:37,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:10:37,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:10:37,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:10:37,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:10:37,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:10:37,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:10:37,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:10:37,711 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:10:37,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:10:37,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:10:37,711 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_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/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_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2022-11-21 16:10:38,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:10:38,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:10:38,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:10:38,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:10:38,116 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:10:38,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-11-21 16:10:41,218 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:10:41,433 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:10:41,433 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-11-21 16:10:41,439 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/data/543252778/60c1b3ffa8a84b11b82816eecd7a4d35/FLAG129fad809 [2022-11-21 16:10:41,463 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/data/543252778/60c1b3ffa8a84b11b82816eecd7a4d35 [2022-11-21 16:10:41,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:10:41,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:10:41,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:10:41,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:10:41,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:10:41,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bca1c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41, skipping insertion in model container [2022-11-21 16:10:41,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:10:41,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:10:41,705 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-11-21 16:10:41,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:10:41,734 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:10:41,746 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-11-21 16:10:41,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:10:41,771 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:10:41,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41 WrapperNode [2022-11-21 16:10:41,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:10:41,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:10:41,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:10:41,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:10:41,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,808 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-11-21 16:10:41,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:10:41,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:10:41,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:10:41,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:10:41,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,831 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:10:41,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:10:41,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:10:41,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:10:41,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (1/1) ... [2022-11-21 16:10:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:10:41,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:41,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:10:41,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:10:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:10:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:10:41,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:10:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:10:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-11-21 16:10:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-11-21 16:10:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:10:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:10:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:10:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:10:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 16:10:41,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 16:10:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:10:42,001 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:10:42,004 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:10:42,208 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:10:42,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:10:42,215 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:10:42,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:42 BoogieIcfgContainer [2022-11-21 16:10:42,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:10:42,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:10:42,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:10:42,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:10:42,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:10:41" (1/3) ... [2022-11-21 16:10:42,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d86a07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:10:42, skipping insertion in model container [2022-11-21 16:10:42,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:41" (2/3) ... [2022-11-21 16:10:42,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d86a07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:10:42, skipping insertion in model container [2022-11-21 16:10:42,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:42" (3/3) ... [2022-11-21 16:10:42,234 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-11-21 16:10:42,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:10:42,256 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-21 16:10:42,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:10:42,341 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;@1512dd50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:10:42,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 16:10:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 16:10:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:10:42,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:42,358 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:42,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1346921732, now seen corresponding path program 1 times [2022-11-21 16:10:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:42,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725985457] [2022-11-21 16:10:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:10:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:42,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725985457] [2022-11-21 16:10:42,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725985457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:42,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:42,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:10:42,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817030223] [2022-11-21 16:10:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:10:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:42,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:10:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:10:42,734 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:10:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:42,772 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-11-21 16:10:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:10:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-21 16:10:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:42,784 INFO L225 Difference]: With dead ends: 89 [2022-11-21 16:10:42,784 INFO L226 Difference]: Without dead ends: 35 [2022-11-21 16:10:42,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:10:42,794 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:42,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:10:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-21 16:10:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-21 16:10:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:10:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-21 16:10:42,848 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2022-11-21 16:10:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:42,849 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-21 16:10:42,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:10:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-21 16:10:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:10:42,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:42,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:42,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:10:42,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1031497992, now seen corresponding path program 1 times [2022-11-21 16:10:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:42,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003922346] [2022-11-21 16:10:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:10:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:43,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003922346] [2022-11-21 16:10:43,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003922346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:43,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:43,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:10:43,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375495442] [2022-11-21 16:10:43,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:43,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:10:43,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:10:43,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:10:43,066 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:10:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:43,088 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-11-21 16:10:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:10:43,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-11-21 16:10:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:43,090 INFO L225 Difference]: With dead ends: 35 [2022-11-21 16:10:43,090 INFO L226 Difference]: Without dead ends: 34 [2022-11-21 16:10:43,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 16:10:43,092 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 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-21 16:10:43,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:10:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-21 16:10:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-21 16:10:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:10:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-21 16:10:43,100 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 16 [2022-11-21 16:10:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:43,101 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-21 16:10:43,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:10:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-21 16:10:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:10:43,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:43,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:10:43,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1911666638, now seen corresponding path program 1 times [2022-11-21 16:10:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:43,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80232422] [2022-11-21 16:10:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:10:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:43,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80232422] [2022-11-21 16:10:43,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80232422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:43,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144388410] [2022-11-21 16:10:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:43,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:43,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:43,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:43,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:10:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:10:43,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:10:43,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:10:43,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144388410] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:43,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:43,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-21 16:10:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437700264] [2022-11-21 16:10:43,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:43,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:10:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:43,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:10:43,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:10:43,662 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 16:10:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:43,757 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-21 16:10:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:10:43,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2022-11-21 16:10:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:43,759 INFO L225 Difference]: With dead ends: 34 [2022-11-21 16:10:43,759 INFO L226 Difference]: Without dead ends: 33 [2022-11-21 16:10:43,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:10:43,760 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:43,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-21 16:10:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-21 16:10:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-21 16:10:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-21 16:10:43,767 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-11-21 16:10:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:43,767 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-21 16:10:43,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 16:10:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-21 16:10:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 16:10:43,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:43,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-21 16:10:43,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 16:10:43,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:43,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 551123241, now seen corresponding path program 1 times [2022-11-21 16:10:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:43,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506398400] [2022-11-21 16:10:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,155 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-21 16:10:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506398400] [2022-11-21 16:10:44,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506398400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:44,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:44,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:10:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668242432] [2022-11-21 16:10:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:44,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:10:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:10:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:10:44,164 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:10:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:44,253 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-11-21 16:10:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:10:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-11-21 16:10:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:44,255 INFO L225 Difference]: With dead ends: 49 [2022-11-21 16:10:44,255 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 16:10:44,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:10:44,257 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:44,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 16:10:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-11-21 16:10:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:10:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-21 16:10:44,266 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-11-21 16:10:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:44,266 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-21 16:10:44,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:10:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-21 16:10:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 16:10:44,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:44,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-21 16:10:44,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:10:44,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:44,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 551123433, now seen corresponding path program 1 times [2022-11-21 16:10:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:44,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326932179] [2022-11-21 16:10:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,433 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-21 16:10:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:44,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326932179] [2022-11-21 16:10:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326932179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:10:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809640116] [2022-11-21 16:10:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:44,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:10:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:10:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:10:44,437 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:10:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:44,534 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-11-21 16:10:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:10:44,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-11-21 16:10:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:44,540 INFO L225 Difference]: With dead ends: 44 [2022-11-21 16:10:44,540 INFO L226 Difference]: Without dead ends: 43 [2022-11-21 16:10:44,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:10:44,544 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:44,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-21 16:10:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-21 16:10:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.206896551724138) internal successors, (35), 32 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:10:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-21 16:10:44,555 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 33 [2022-11-21 16:10:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:44,555 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-21 16:10:44,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:10:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-21 16:10:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 16:10:44,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:44,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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-21 16:10:44,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:10:44,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash -95042683, now seen corresponding path program 1 times [2022-11-21 16:10:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:44,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370864127] [2022-11-21 16:10:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:44,760 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-21 16:10:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:44,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370864127] [2022-11-21 16:10:44,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370864127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:44,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:44,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:10:44,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443564993] [2022-11-21 16:10:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:10:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:10:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:10:44,767 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:10:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:44,869 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-11-21 16:10:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:10:44,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-11-21 16:10:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:44,873 INFO L225 Difference]: With dead ends: 45 [2022-11-21 16:10:44,874 INFO L226 Difference]: Without dead ends: 44 [2022-11-21 16:10:44,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:10:44,880 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:44,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 171 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:10:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-21 16:10:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-11-21 16:10:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 16:10:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-21 16:10:44,900 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2022-11-21 16:10:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:44,901 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-21 16:10:44,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:10:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-21 16:10:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 16:10:44,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:44,903 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-21 16:10:44,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:10:44,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1626861010, now seen corresponding path program 1 times [2022-11-21 16:10:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:44,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420681415] [2022-11-21 16:10:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:10:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:10:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:45,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:45,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420681415] [2022-11-21 16:10:45,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420681415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:45,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284534290] [2022-11-21 16:10:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:45,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:45,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:45,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:45,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:10:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:45,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:10:45,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:45,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284534290] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:45,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:45,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-21 16:10:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21666687] [2022-11-21 16:10:45,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:45,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 16:10:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 16:10:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:10:45,396 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-21 16:10:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:45,737 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-11-21 16:10:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 16:10:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 50 [2022-11-21 16:10:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:45,742 INFO L225 Difference]: With dead ends: 87 [2022-11-21 16:10:45,742 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 16:10:45,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2022-11-21 16:10:45,744 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 119 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:45,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 229 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 16:10:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-11-21 16:10:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 55 states have internal predecessors, (65), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 16:10:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-11-21 16:10:45,771 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 50 [2022-11-21 16:10:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:45,772 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-11-21 16:10:45,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-21 16:10:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-11-21 16:10:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:10:45,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:45,773 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-21 16:10:45,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 16:10:45,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:45,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:45,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1106916314, now seen corresponding path program 1 times [2022-11-21 16:10:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:45,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261721553] [2022-11-21 16:10:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:10:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:10:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:46,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:46,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261721553] [2022-11-21 16:10:46,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261721553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:46,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457396276] [2022-11-21 16:10:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:46,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:46,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:46,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:10:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:10:46,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:46,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:10:46,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457396276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:46,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:10:46,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-11-21 16:10:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276016438] [2022-11-21 16:10:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:46,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:10:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:46,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:10:46,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:10:46,412 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 16:10:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:46,530 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-11-21 16:10:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:10:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-11-21 16:10:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:46,534 INFO L225 Difference]: With dead ends: 76 [2022-11-21 16:10:46,534 INFO L226 Difference]: Without dead ends: 75 [2022-11-21 16:10:46,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:10:46,536 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:46,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-21 16:10:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-21 16:10:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 16:10:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2022-11-21 16:10:46,556 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 51 [2022-11-21 16:10:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:46,558 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2022-11-21 16:10:46,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-21 16:10:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-11-21 16:10:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:10:46,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:46,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:46,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 16:10:46,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:46,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1106922272, now seen corresponding path program 1 times [2022-11-21 16:10:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:46,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506944053] [2022-11-21 16:10:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:10:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:10:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506944053] [2022-11-21 16:10:46,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506944053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:46,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238523815] [2022-11-21 16:10:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:46,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:47,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:10:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:47,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:10:47,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:47,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-21 16:10:47,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238523815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:47,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:47,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-11-21 16:10:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004679031] [2022-11-21 16:10:47,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:47,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:10:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:10:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-11-21 16:10:47,358 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-21 16:10:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:47,659 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2022-11-21 16:10:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:10:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 51 [2022-11-21 16:10:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:47,663 INFO L225 Difference]: With dead ends: 78 [2022-11-21 16:10:47,663 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 16:10:47,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2022-11-21 16:10:47,666 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:47,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 323 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 16:10:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-21 16:10:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 16:10:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-11-21 16:10:47,687 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 51 [2022-11-21 16:10:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:47,688 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-11-21 16:10:47,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-21 16:10:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-11-21 16:10:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 16:10:47,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:47,695 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:47,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:47,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:47,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1638655593, now seen corresponding path program 2 times [2022-11-21 16:10:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:47,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515640591] [2022-11-21 16:10:47,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:10:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:10:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:10:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:10:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:10:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:10:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:10:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:10:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-21 16:10:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:48,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515640591] [2022-11-21 16:10:48,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515640591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:48,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721824057] [2022-11-21 16:10:48,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:10:48,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:48,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:48,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:10:48,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:10:48,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:10:48,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 16:10:48,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-21 16:10:48,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-21 16:10:48,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721824057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:48,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:48,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-11-21 16:10:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377119420] [2022-11-21 16:10:48,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:48,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-21 16:10:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:48,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 16:10:48,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 16:10:48,990 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-21 16:10:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:49,721 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-11-21 16:10:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-21 16:10:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 101 [2022-11-21 16:10:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:49,723 INFO L225 Difference]: With dead ends: 151 [2022-11-21 16:10:49,723 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 16:10:49,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=986, Invalid=3046, Unknown=0, NotChecked=0, Total=4032 [2022-11-21 16:10:49,726 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 383 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:49,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 353 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:10:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 16:10:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 139. [2022-11-21 16:10:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.12) internal successors, (112), 101 states have internal predecessors, (112), 36 states have call successors, (36), 13 states have call predecessors, (36), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-21 16:10:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2022-11-21 16:10:49,739 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 101 [2022-11-21 16:10:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:49,740 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2022-11-21 16:10:49,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-21 16:10:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-11-21 16:10:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-21 16:10:49,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:49,742 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:49,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:49,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 16:10:49,948 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 269196873, now seen corresponding path program 3 times [2022-11-21 16:10:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:49,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138539605] [2022-11-21 16:10:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:10:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:10:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:10:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:10:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:10:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:10:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:10:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:10:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-21 16:10:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 16:10:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:10:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:10:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:10:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:10:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-21 16:10:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-21 16:10:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-21 16:10:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-21 16:10:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-21 16:10:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-21 16:10:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-11-21 16:10:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138539605] [2022-11-21 16:10:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138539605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959605551] [2022-11-21 16:10:51,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:10:51,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:51,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:51,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:10:51,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-11-21 16:10:51,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:10:51,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 16:10:51,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-11-21 16:10:52,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-11-21 16:10:52,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959605551] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:52,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:52,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2022-11-21 16:10:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187731075] [2022-11-21 16:10:52,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:52,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-21 16:10:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:52,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 16:10:52,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2022-11-21 16:10:52,652 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-21 16:10:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:55,978 INFO L93 Difference]: Finished difference Result 307 states and 381 transitions. [2022-11-21 16:10:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-11-21 16:10:55,978 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 203 [2022-11-21 16:10:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:55,982 INFO L225 Difference]: With dead ends: 307 [2022-11-21 16:10:55,982 INFO L226 Difference]: Without dead ends: 306 [2022-11-21 16:10:55,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5493 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4130, Invalid=14776, Unknown=0, NotChecked=0, Total=18906 [2022-11-21 16:10:55,990 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1199 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:55,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 744 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:10:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-21 16:10:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 255. [2022-11-21 16:10:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.1404494382022472) internal successors, (203), 178 states have internal predecessors, (203), 74 states have call successors, (74), 26 states have call predecessors, (74), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-21 16:10:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2022-11-21 16:10:56,059 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 203 [2022-11-21 16:10:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:56,059 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2022-11-21 16:10:56,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-21 16:10:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2022-11-21 16:10:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-21 16:10:56,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:56,069 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:56,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:56,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:56,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:10:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1401050065, now seen corresponding path program 1 times [2022-11-21 16:10:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:56,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902171630] [2022-11-21 16:10:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:10:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:10:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:10:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:10:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:10:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:10:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:10:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:10:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:10:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:10:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:10:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-21 16:10:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 16:10:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:10:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:10:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:10:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:10:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-21 16:10:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-21 16:10:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-21 16:10:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-21 16:10:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-21 16:10:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-21 16:10:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-21 16:10:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-21 16:10:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-21 16:10:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-21 16:10:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-11-21 16:10:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:58,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902171630] [2022-11-21 16:10:58,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902171630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:58,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380902758] [2022-11-21 16:10:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:58,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:58,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:58,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:10:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:58,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 16:10:58,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-11-21 16:10:58,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-11-21 16:11:00,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380902758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:00,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:00,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 76 [2022-11-21 16:11:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114463085] [2022-11-21 16:11:00,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:00,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-21 16:11:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-21 16:11:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=4801, Unknown=0, NotChecked=0, Total=5852 [2022-11-21 16:11:00,291 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) [2022-11-21 16:11:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:03,282 INFO L93 Difference]: Finished difference Result 544 states and 706 transitions. [2022-11-21 16:11:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-21 16:11:03,283 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) Word has length 237 [2022-11-21 16:11:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:03,295 INFO L225 Difference]: With dead ends: 544 [2022-11-21 16:11:03,295 INFO L226 Difference]: Without dead ends: 543 [2022-11-21 16:11:03,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6403 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5207, Invalid=16549, Unknown=0, NotChecked=0, Total=21756 [2022-11-21 16:11:03,305 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 972 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:03,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 670 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:11:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-21 16:11:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 515. [2022-11-21 16:11:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 360 states have internal predecessors, (411), 152 states have call successors, (152), 52 states have call predecessors, (152), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-11-21 16:11:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 665 transitions. [2022-11-21 16:11:03,368 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 665 transitions. Word has length 237 [2022-11-21 16:11:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:03,369 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 665 transitions. [2022-11-21 16:11:03,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) [2022-11-21 16:11:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 665 transitions. [2022-11-21 16:11:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2022-11-21 16:11:03,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:03,380 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:03,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 16:11:03,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:11:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash 255499764, now seen corresponding path program 2 times [2022-11-21 16:11:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:03,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162835498] [2022-11-21 16:11:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:11:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:11:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:11:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:11:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:11:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:11:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:11:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:11:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:11:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:11:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:11:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:11:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-21 16:11:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 16:11:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:11:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:11:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:11:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:11:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-21 16:11:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-21 16:11:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-21 16:11:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-21 16:11:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-21 16:11:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-21 16:11:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-21 16:11:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-21 16:11:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-21 16:11:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-21 16:11:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-21 16:11:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-21 16:11:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-21 16:11:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-21 16:11:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-11-21 16:11:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-11-21 16:11:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-21 16:11:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-21 16:11:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-21 16:11:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-21 16:11:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-21 16:11:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-21 16:11:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-21 16:11:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-21 16:11:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-11-21 16:11:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-11-21 16:11:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-21 16:11:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-11-21 16:11:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-11-21 16:11:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-11-21 16:11:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-11-21 16:11:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-21 16:11:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-11-21 16:11:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-11-21 16:11:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-11-21 16:11:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-11-21 16:11:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-11-21 16:11:09,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:09,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162835498] [2022-11-21 16:11:09,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162835498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:09,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855386591] [2022-11-21 16:11:09,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:11:09,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:09,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:09,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:11:09,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:11:09,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:09,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-21 16:11:09,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-11-21 16:11:10,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-11-21 16:11:15,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855386591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:15,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:15,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 154 [2022-11-21 16:11:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358767279] [2022-11-21 16:11:15,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:15,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-11-21 16:11:15,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-11-21 16:11:15,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4132, Invalid=19738, Unknown=0, NotChecked=0, Total=23870 [2022-11-21 16:11:15,104 INFO L87 Difference]: Start difference. First operand 515 states and 665 transitions. Second operand has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) [2022-11-21 16:11:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:24,969 INFO L93 Difference]: Finished difference Result 1090 states and 1421 transitions. [2022-11-21 16:11:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-21 16:11:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) Word has length 458 [2022-11-21 16:11:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:24,978 INFO L225 Difference]: With dead ends: 1090 [2022-11-21 16:11:24,978 INFO L226 Difference]: Without dead ends: 1089 [2022-11-21 16:11:24,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1273 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27814 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=21886, Invalid=70226, Unknown=0, NotChecked=0, Total=92112 [2022-11-21 16:11:24,989 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 2398 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:24,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 1497 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 16:11:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-11-21 16:11:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1035. [2022-11-21 16:11:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 724 states have (on average 1.1422651933701657) internal successors, (827), 724 states have internal predecessors, (827), 308 states have call successors, (308), 104 states have call predecessors, (308), 2 states have return successors, (206), 206 states have call predecessors, (206), 206 states have call successors, (206) [2022-11-21 16:11:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1341 transitions. [2022-11-21 16:11:25,076 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1341 transitions. Word has length 458 [2022-11-21 16:11:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:25,077 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1341 transitions. [2022-11-21 16:11:25,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) [2022-11-21 16:11:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1341 transitions. [2022-11-21 16:11:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-11-21 16:11:25,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:25,113 INFO L195 NwaCegarLoop]: trace histogram [54, 54, 54, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:25,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:25,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:25,321 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-21 16:11:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1135257556, now seen corresponding path program 3 times [2022-11-21 16:11:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:25,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919636098] [2022-11-21 16:11:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:11:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-21 16:11:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:11:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:11:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:11:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 16:11:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:11:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:11:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:11:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-21 16:11:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:11:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:11:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-21 16:11:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 16:11:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:11:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:11:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-21 16:11:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:11:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-21 16:11:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-21 16:11:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-21 16:11:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-21 16:11:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-21 16:11:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-21 16:11:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-21 16:11:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-21 16:11:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-21 16:11:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-21 16:11:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-21 16:11:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-21 16:11:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-21 16:11:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-21 16:11:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-11-21 16:11:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-11-21 16:11:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-21 16:11:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-21 16:11:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-21 16:11:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-21 16:11:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-21 16:11:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-21 16:11:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-21 16:11:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-21 16:11:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-11-21 16:11:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-11-21 16:11:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-21 16:11:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-11-21 16:11:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-11-21 16:11:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-11-21 16:11:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-11-21 16:11:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-21 16:11:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-11-21 16:11:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-11-21 16:11:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-11-21 16:11:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-11-21 16:11:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2022-11-21 16:11:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-11-21 16:11:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2022-11-21 16:11:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2022-11-21 16:11:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2022-11-21 16:11:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501 [2022-11-21 16:11:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2022-11-21 16:11:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2022-11-21 16:11:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2022-11-21 16:11:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2022-11-21 16:11:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2022-11-21 16:11:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2022-11-21 16:11:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2022-11-21 16:11:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 569 [2022-11-21 16:11:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2022-11-21 16:11:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2022-11-21 16:11:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2022-11-21 16:11:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2022-11-21 16:11:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 615 [2022-11-21 16:11:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 620 [2022-11-21 16:11:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2022-11-21 16:11:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2022-11-21 16:11:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 649 [2022-11-21 16:11:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 654 [2022-11-21 16:11:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2022-11-21 16:11:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2022-11-21 16:11:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2022-11-21 16:11:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2022-11-21 16:11:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 700 [2022-11-21 16:11:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 705 [2022-11-21 16:11:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-11-21 16:11:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 722 [2022-11-21 16:11:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2022-11-21 16:11:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2022-11-21 16:11:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2022-11-21 16:11:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2022-11-21 16:11:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 768 [2022-11-21 16:11:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 773 [2022-11-21 16:11:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2022-11-21 16:11:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 790 [2022-11-21 16:11:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 802 [2022-11-21 16:11:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 807 [2022-11-21 16:11:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2022-11-21 16:11:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 824 [2022-11-21 16:11:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 836 [2022-11-21 16:11:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 841 [2022-11-21 16:11:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 853 [2022-11-21 16:11:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 858 [2022-11-21 16:11:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2022-11-21 16:11:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2022-11-21 16:11:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 887 [2022-11-21 16:11:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 892 [2022-11-21 16:11:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 22759 backedges. 0 proven. 11724 refuted. 0 times theorem prover too weak. 11035 trivial. 0 not checked. [2022-11-21 16:11:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919636098] [2022-11-21 16:11:45,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919636098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:45,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026378669] [2022-11-21 16:11:45,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:11:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:45,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:46,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:11:46,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 16:11:46,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:46,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:11:46,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22759 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 22353 trivial. 0 not checked. [2022-11-21 16:11:46,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:46,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026378669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:46,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:11:46,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [154] total 159 [2022-11-21 16:11:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095055298] [2022-11-21 16:11:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:46,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:11:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:11:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4244, Invalid=21196, Unknown=0, NotChecked=0, Total=25440 [2022-11-21 16:11:46,677 INFO L87 Difference]: Start difference. First operand 1035 states and 1341 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-21 16:11:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:47,153 INFO L93 Difference]: Finished difference Result 1238 states and 1544 transitions. [2022-11-21 16:11:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:11:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 900 [2022-11-21 16:11:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:47,157 INFO L225 Difference]: With dead ends: 1238 [2022-11-21 16:11:47,157 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:11:47,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1323 GetRequests, 1161 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8152 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=4270, Invalid=22462, Unknown=0, NotChecked=0, Total=26732 [2022-11-21 16:11:47,166 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:47,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:11:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:11:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:11:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:11:47,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 900 [2022-11-21 16:11:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:11:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-21 16:11:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:11:47,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:11:47,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-21 16:11:47,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-21 16:11:47,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-21 16:11:47,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-21 16:11:47,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-21 16:11:47,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-21 16:11:47,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:47,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 16:11:47,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:12:10,049 WARN L233 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 854 DAG size of output: 269 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 16:12:10,058 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-21 16:12:10,058 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:12:10,058 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:12:10,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-21 16:12:10,059 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-11-21 16:12:10,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:12:10,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:12:10,059 INFO L902 garLoopResultBuilder]: At program point L53(lines 40 54) the Hoare annotation is: true [2022-11-21 16:12:10,059 INFO L902 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-11-21 16:12:10,060 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-11-21 16:12:10,060 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-11-21 16:12:10,060 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-11-21 16:12:10,060 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-11-21 16:12:10,060 INFO L895 garLoopResultBuilder]: At program point L47-2(line 47) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-11-21 16:12:10,060 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-11-21 16:12:10,060 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2022-11-21 16:12:10,060 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 2147483647) [2022-11-21 16:12:10,060 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-11-21 16:12:10,060 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L902 garLoopResultBuilder]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-21 16:12:10,061 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 16 38) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-11-21 16:12:10,062 INFO L899 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2022-11-21 16:12:10,064 INFO L895 garLoopResultBuilder]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse4 (<= |check_#in~y| 2147483646))) (let ((.cse5 (<= 1 check_~y)) (.cse6 (<= 1 check_~x)) (.cse3 (<= check_~y 2147483646)) (.cse0 (not .cse4)) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (< check_~x 2147483647) (not (< |check_#in~x| 2147483647))) (or .cse0 (<= check_~x 16) .cse1 .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (< check_~x 2147483646) (not (< |check_#in~x| 2147483645)) .cse1 .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483623)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (< check_~x 2147483627) .cse2 (not (< |check_#in~x| 2147483626))) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483631) .cse2) (or .cse0 (<= check_~x 23) .cse1 (not (<= |check_#in~x| 22)) .cse2) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483637))) (or .cse0 (<= check_~x 19) .cse1 (not (<= |check_#in~x| 18)) .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483625)) (< check_~x 2147483626)) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 7))) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483644)) (< check_~x 2147483645)) (or .cse0 .cse1 (< check_~x 2147483632) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 (<= check_~x 24) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 .cse1 (< check_~x 2147483634) .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483643)) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) (<= check_~x 15) .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483627)) .cse2 (< check_~x 2147483628)) (or (not (<= |check_#in~x| 16)) .cse0 .cse1 (<= check_~x 17) .cse2) (or .cse0 (<= check_~x 9) .cse1 .cse2 (not (<= |check_#in~x| 8))) (or .cse0 (not (= |check_#in~x| 0)) (and (= check_~x 0) (< 0 (+ check_~y 2147483648)) .cse3) (and .cse4 .cse5 (<= check_~x 1) .cse6 .cse3)) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483635) .cse2) (or .cse0 .cse1 (<= check_~x 5) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 21)) (<= check_~x 22)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 .cse1 (<= check_~x 12) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (not (<= |check_#in~x| 17)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 (< check_~x 2147483630) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (< check_~x 2147483625) .cse1 (not (< |check_#in~x| 2147483624)) .cse2) (or (not (<= |check_#in~x| 24)) .cse0 .cse1 (< check_~x 2147483623) .cse2) (or .cse0 .cse1 (and .cse4 .cse5 .cse6 .cse3) .cse2) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 11) .cse2) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (<= check_~x 2) (not (<= |check_#in~x| 1)) .cse2) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 14)) (or (not (< |check_#in~x| 2147483632)) .cse0 (< check_~x 2147483633) .cse1 .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) (< check_~x 2147483636) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483640)) (< check_~x 2147483641)) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) .cse2 (<= check_~x 6)) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483628))) (or .cse0 (not (<= |check_#in~x| 9)) .cse1 (<= check_~x 10) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) .cse2 (<= check_~x 13))))) [2022-11-21 16:12:10,065 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (not (<= |check_#in~y| 2147483646))) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483630) .cse2) (or .cse0 .cse1 (and (<= 2 check_~y) (<= 1 check_~x) .cse3) .cse2) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 21))) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) .cse2 (<= check_~x 14)) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 10) .cse2) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse3) (not (= |check_#in~x| 0))) (or (not (<= |check_#in~x| 24)) .cse0 (<= check_~x 24) .cse1 .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 22)) .cse2 (<= check_~x 22)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 (not (<= |check_#in~x| 18)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 13)) (or .cse0 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483628)) (< check_~x 2147483628)) (or .cse0 .cse1 .cse2 (< check_~x 2147483626) (not (< |check_#in~x| 2147483626))) (or .cse0 .cse1 .cse2 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483624)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse2) (or .cse0 .cse1 (<= check_~x 15) .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483631) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483640))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 .cse2 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (< check_~x 2147483623) (not (< |check_#in~x| 2147483623)) .cse2) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (<= check_~x 23) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 (< check_~x 2147483636) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (<= check_~x 19) .cse1 .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (<= check_~x 2) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (not (< |check_#in~x| 2147483645)) .cse1 .cse2 (< check_~x 2147483645)) (or (not (< |check_#in~x| 2147483632)) .cse0 .cse1 (< check_~x 2147483632) .cse2) (or .cse0 (< check_~x 2147483633) .cse1 .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) (<= check_~x 12) .cse2) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483634) .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) .cse1 (< check_~x 2147483635) .cse2) (or (not (<= |check_#in~x| 16)) .cse0 (<= check_~x 16) .cse1 .cse2) (or .cse0 (< check_~x 2147483625) .cse1 .cse2 (not (< |check_#in~x| 2147483625))) (or .cse0 .cse1 (<= check_~x 11) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (<= check_~x 17) (not (<= |check_#in~x| 17)) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 1)) .cse2 (<= check_~x 1)) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483641)) (or .cse0 .cse1 (< check_~x 2147483627) (not (< |check_#in~x| 2147483627)) .cse2))) [2022-11-21 16:12:10,066 INFO L895 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (not (<= |check_#in~y| 2147483646))) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483630) .cse2) (or .cse0 .cse1 (and (<= 2 check_~y) (<= 1 check_~x) .cse3) .cse2) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 21))) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) .cse2 (<= check_~x 14)) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 10) .cse2) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse3) (not (= |check_#in~x| 0))) (or (not (<= |check_#in~x| 24)) .cse0 (<= check_~x 24) .cse1 .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 22)) .cse2 (<= check_~x 22)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 (not (<= |check_#in~x| 18)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 13)) (or .cse0 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483628)) (< check_~x 2147483628)) (or .cse0 .cse1 .cse2 (< check_~x 2147483626) (not (< |check_#in~x| 2147483626))) (or .cse0 .cse1 .cse2 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483624)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse2) (or .cse0 .cse1 (<= check_~x 15) .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483631) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483640))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 .cse2 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (< check_~x 2147483623) (not (< |check_#in~x| 2147483623)) .cse2) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (<= check_~x 23) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 (< check_~x 2147483636) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (<= check_~x 19) .cse1 .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (<= check_~x 2) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (not (< |check_#in~x| 2147483645)) .cse1 .cse2 (< check_~x 2147483645)) (or (not (< |check_#in~x| 2147483632)) .cse0 .cse1 (< check_~x 2147483632) .cse2) (or .cse0 (< check_~x 2147483633) .cse1 .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) (<= check_~x 12) .cse2) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483634) .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) .cse1 (< check_~x 2147483635) .cse2) (or (not (<= |check_#in~x| 16)) .cse0 (<= check_~x 16) .cse1 .cse2) (or .cse0 (< check_~x 2147483625) .cse1 .cse2 (not (< |check_#in~x| 2147483625))) (or .cse0 .cse1 (<= check_~x 11) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (<= check_~x 17) (not (<= |check_#in~x| 17)) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 1)) .cse2 (<= check_~x 1)) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483641)) (or .cse0 .cse1 (< check_~x 2147483627) (not (< |check_#in~x| 2147483627)) .cse2))) [2022-11-21 16:12:10,066 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 16 38) no Hoare annotation was computed. [2022-11-21 16:12:10,066 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-11-21 16:12:10,066 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-11-21 16:12:10,066 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-11-21 16:12:10,067 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-11-21 16:12:10,067 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2022-11-21 16:12:10,067 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2022-11-21 16:12:10,070 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:10,072 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:12:10,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:12:10 BoogieIcfgContainer [2022-11-21 16:12:10,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:12:10,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:12:10,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:12:10,080 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:12:10,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:42" (3/4) ... [2022-11-21 16:12:10,083 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:12:10,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 16:12:10,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2022-11-21 16:12:10,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-21 16:12:10,093 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-21 16:12:10,093 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-21 16:12:10,093 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 16:12:10,093 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:12:10,135 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:12:10,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:12:10,136 INFO L158 Benchmark]: Toolchain (without parser) took 88669.38ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 150.1MB in the beginning and 936.1MB in the end (delta: -786.0MB). Peak memory consumption was 503.6MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,136 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory was 100.1MB in the beginning and 100.0MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:12:10,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.62ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 142.5MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 178.3MB. Free memory was 142.5MB in the beginning and 141.6MB in the end (delta: 917.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,138 INFO L158 Benchmark]: Boogie Preprocessor took 25.47ms. Allocated memory is still 178.3MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,140 INFO L158 Benchmark]: RCFGBuilder took 382.55ms. Allocated memory is still 178.3MB. Free memory was 139.5MB in the beginning and 126.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,141 INFO L158 Benchmark]: TraceAbstraction took 87859.65ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 126.0MB in the beginning and 939.2MB in the end (delta: -813.2MB). Peak memory consumption was 899.1MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,141 INFO L158 Benchmark]: Witness Printer took 55.54ms. Allocated memory is still 1.5GB. Free memory was 939.2MB in the beginning and 936.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:12:10,143 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory was 100.1MB in the beginning and 100.0MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.62ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 142.5MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 178.3MB. Free memory was 142.5MB in the beginning and 141.6MB in the end (delta: 917.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.47ms. Allocated memory is still 178.3MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 382.55ms. Allocated memory is still 178.3MB. Free memory was 139.5MB in the beginning and 126.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 87859.65ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 126.0MB in the beginning and 939.2MB in the end (delta: -813.2MB). Peak memory consumption was 899.1MB. Max. memory is 16.1GB. * Witness Printer took 55.54ms. Allocated memory is still 1.5GB. Free memory was 939.2MB in the beginning and 936.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 87.8s, OverallIterations: 14, TraceHistogramMax: 54, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5276 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5276 mSDsluCounter, 4741 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4078 mSDsCounter, 996 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3588 IncrementalHoareTripleChecker+Invalid, 4584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 996 mSolverCounterUnsat, 663 mSDtfsCounter, 3588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4546 GetRequests, 3637 SyntacticMatches, 0 SemanticMatches, 909 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49364 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1035occurred in iteration=13, InterpolantAutomatonStates: 534, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 1243 PreInvPairs, 2059 NumberOfFragments, 3049 HoareAnnotationTreeSize, 1243 FomulaSimplifications, 4701 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 524052 FormulaSimplificationTreeSizeReductionInter, 15.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 4268 NumberOfCodeBlocks, 3395 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 9750 SizeOfPredicates, 118 NumberOfNonLiveVariables, 4381 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 47569/70567 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 16:12:10,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395ddc49-8daf-48f0-8878-8d25cf2eb173/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE