./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:20:46,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:20:46,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:20:46,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:20:46,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:20:46,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:20:46,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:20:46,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:20:46,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:20:46,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:20:46,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:20:46,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:20:46,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:20:46,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:20:46,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:20:46,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:20:46,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:20:46,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:20:46,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:20:46,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:20:46,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:20:46,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:20:46,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:20:46,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:20:46,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:20:46,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:20:46,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:20:46,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:20:46,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:20:46,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:20:46,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:20:46,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:20:46,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:20:46,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:20:46,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:20:46,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:20:46,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:20:46,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:20:46,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:20:46,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:20:46,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:20:46,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2020-11-30 02:20:46,246 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:20:46,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:20:46,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:20:46,247 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:20:46,247 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:20:46,248 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:20:46,248 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:20:46,248 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:20:46,248 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:20:46,248 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:20:46,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:20:46,249 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:20:46,249 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:20:46,249 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:20:46,250 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:20:46,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:20:46,254 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 02:20:46,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:20:46,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:20:46,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:20:46,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:20:46,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:20:46,255 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-11-30 02:20:46,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:20:46,256 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:20:46,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:20:46,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:20:46,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:20:46,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:20:46,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:20:46,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:20:46,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:20:46,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:20:46,260 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:20:46,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:20:46,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:20:46,261 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:20:46,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:20:46,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/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-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2020-11-30 02:20:46,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:20:46,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:20:46,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:20:46,615 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:20:46,616 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:20:46,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-11-30 02:20:46,684 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/data/744ee3f15/7998d5d91da3479291628e16412bece7/FLAG380930afe [2020-11-30 02:20:47,255 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:20:47,256 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-11-30 02:20:47,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/data/744ee3f15/7998d5d91da3479291628e16412bece7/FLAG380930afe [2020-11-30 02:20:47,627 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/data/744ee3f15/7998d5d91da3479291628e16412bece7 [2020-11-30 02:20:47,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:20:47,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:20:47,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:20:47,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:20:47,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:20:47,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:47,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f25028a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47, skipping insertion in model container [2020-11-30 02:20:47,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:47,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:20:47,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:20:47,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:20:47,885 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:20:47,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:20:47,932 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:20:47,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47 WrapperNode [2020-11-30 02:20:47,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:20:47,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:20:47,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:20:47,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:20:47,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:47,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:47,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:20:47,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:20:47,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:20:47,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:20:47,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:47,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:48,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:48,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:48,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:48,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:48,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... [2020-11-30 02:20:48,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:20:48,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:20:48,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:20:48,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:20:48,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:20:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:20:48,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:20:48,527 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:20:48,527 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-30 02:20:48,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:20:48 BoogieIcfgContainer [2020-11-30 02:20:48,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:20:48,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:20:48,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:20:48,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:20:48,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:20:47" (1/3) ... [2020-11-30 02:20:48,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dce1ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:20:48, skipping insertion in model container [2020-11-30 02:20:48,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:20:47" (2/3) ... [2020-11-30 02:20:48,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dce1ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:20:48, skipping insertion in model container [2020-11-30 02:20:48,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:20:48" (3/3) ... [2020-11-30 02:20:48,538 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-11-30 02:20:48,549 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:20:48,553 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-11-30 02:20:48,566 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-30 02:20:48,591 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:20:48,592 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:20:48,592 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:20:48,592 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:20:48,592 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:20:48,593 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:20:48,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:20:48,593 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:20:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-11-30 02:20:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 02:20:48,620 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:48,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 02:20:48,622 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 29686488, now seen corresponding path program 1 times [2020-11-30 02:20:48,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:48,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457162607] [2020-11-30 02:20:48,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:48,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457162607] [2020-11-30 02:20:48,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:48,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:20:48,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635676663] [2020-11-30 02:20:48,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:20:48,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:20:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:48,867 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-11-30 02:20:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:48,949 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2020-11-30 02:20:48,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:20:48,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 02:20:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:48,959 INFO L225 Difference]: With dead ends: 66 [2020-11-30 02:20:48,960 INFO L226 Difference]: Without dead ends: 40 [2020-11-30 02:20:48,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-30 02:20:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2020-11-30 02:20:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-30 02:20:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-11-30 02:20:49,037 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2020-11-30 02:20:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:49,037 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-11-30 02:20:49,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:20:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-11-30 02:20:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 02:20:49,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:49,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 02:20:49,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:20:49,039 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:49,040 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2020-11-30 02:20:49,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:49,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420059381] [2020-11-30 02:20:49,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420059381] [2020-11-30 02:20:49,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:49,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:20:49,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993607133] [2020-11-30 02:20:49,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:20:49,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:20:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,118 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2020-11-30 02:20:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:49,166 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-11-30 02:20:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:20:49,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 02:20:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:49,168 INFO L225 Difference]: With dead ends: 34 [2020-11-30 02:20:49,168 INFO L226 Difference]: Without dead ends: 33 [2020-11-30 02:20:49,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-30 02:20:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-11-30 02:20:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-30 02:20:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-11-30 02:20:49,177 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2020-11-30 02:20:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:49,179 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-11-30 02:20:49,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:20:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-11-30 02:20:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 02:20:49,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:49,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 02:20:49,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:20:49,182 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash 920281212, now seen corresponding path program 1 times [2020-11-30 02:20:49,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:49,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018578216] [2020-11-30 02:20:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018578216] [2020-11-30 02:20:49,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:49,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:20:49,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610476965] [2020-11-30 02:20:49,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:20:49,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:20:49,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,229 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2020-11-30 02:20:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:49,266 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-11-30 02:20:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:20:49,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-11-30 02:20:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:49,268 INFO L225 Difference]: With dead ends: 45 [2020-11-30 02:20:49,268 INFO L226 Difference]: Without dead ends: 44 [2020-11-30 02:20:49,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-30 02:20:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-11-30 02:20:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-30 02:20:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-11-30 02:20:49,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2020-11-30 02:20:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:49,275 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-11-30 02:20:49,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:20:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-11-30 02:20:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 02:20:49,276 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:49,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 02:20:49,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:20:49,276 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2020-11-30 02:20:49,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:49,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956361584] [2020-11-30 02:20:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956361584] [2020-11-30 02:20:49,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:49,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:20:49,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693178950] [2020-11-30 02:20:49,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:20:49,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:49,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:20:49,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,341 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2020-11-30 02:20:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:49,372 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-11-30 02:20:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:20:49,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-11-30 02:20:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:49,375 INFO L225 Difference]: With dead ends: 31 [2020-11-30 02:20:49,375 INFO L226 Difference]: Without dead ends: 30 [2020-11-30 02:20:49,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-11-30 02:20:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-30 02:20:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-30 02:20:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-11-30 02:20:49,383 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2020-11-30 02:20:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:49,383 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-11-30 02:20:49,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:20:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-11-30 02:20:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 02:20:49,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:49,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:49,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:20:49,385 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2020-11-30 02:20:49,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:49,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264686602] [2020-11-30 02:20:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264686602] [2020-11-30 02:20:49,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:49,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 02:20:49,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278497498] [2020-11-30 02:20:49,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:20:49,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:20:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,446 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2020-11-30 02:20:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:49,470 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-11-30 02:20:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:20:49,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-30 02:20:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:49,473 INFO L225 Difference]: With dead ends: 30 [2020-11-30 02:20:49,473 INFO L226 Difference]: Without dead ends: 29 [2020-11-30 02:20:49,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-11-30 02:20:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-11-30 02:20:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-30 02:20:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-11-30 02:20:49,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2020-11-30 02:20:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:49,484 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-11-30 02:20:49,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:20:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-11-30 02:20:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 02:20:49,484 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:49,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:49,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:20:49,485 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2020-11-30 02:20:49,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:49,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781464184] [2020-11-30 02:20:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781464184] [2020-11-30 02:20:49,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:49,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:20:49,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255115081] [2020-11-30 02:20:49,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:20:49,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:49,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:20:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,528 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2020-11-30 02:20:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:49,554 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-11-30 02:20:49,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:20:49,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-30 02:20:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:49,556 INFO L225 Difference]: With dead ends: 29 [2020-11-30 02:20:49,556 INFO L226 Difference]: Without dead ends: 28 [2020-11-30 02:20:49,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:20:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-11-30 02:20:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-11-30 02:20:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-30 02:20:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-11-30 02:20:49,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2020-11-30 02:20:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:49,565 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-11-30 02:20:49,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:20:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-11-30 02:20:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 02:20:49,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:49,565 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-11-30 02:20:49,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:20:49,566 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1321380767, now seen corresponding path program 1 times [2020-11-30 02:20:49,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:49,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943945779] [2020-11-30 02:20:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943945779] [2020-11-30 02:20:49,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325795789] [2020-11-30 02:20:49,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:49,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:20:49,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:49,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1603522990] [2020-11-30 02:20:49,782 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-11-30 02:20:49,783 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:49,788 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:49,793 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:49,794 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:50,097 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:20:50,527 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-11-30 02:20:50,785 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:20:50,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:50,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2020-11-30 02:20:50,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52091147] [2020-11-30 02:20:50,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:20:50,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:50,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:20:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:20:50,788 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2020-11-30 02:20:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:50,893 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2020-11-30 02:20:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:20:50,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 02:20:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:50,896 INFO L225 Difference]: With dead ends: 81 [2020-11-30 02:20:50,896 INFO L226 Difference]: Without dead ends: 80 [2020-11-30 02:20:50,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:20:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-30 02:20:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2020-11-30 02:20:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 02:20:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2020-11-30 02:20:50,911 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 9 [2020-11-30 02:20:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:50,911 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-11-30 02:20:50,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:20:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2020-11-30 02:20:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:20:50,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:50,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:51,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 02:20:51,127 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:51,128 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2020-11-30 02:20:51,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:51,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943975] [2020-11-30 02:20:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:51,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943975] [2020-11-30 02:20:51,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:51,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:20:51,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677956060] [2020-11-30 02:20:51,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:20:51,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:51,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:20:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:20:51,179 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 4 states. [2020-11-30 02:20:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:51,347 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2020-11-30 02:20:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:20:51,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 02:20:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:51,351 INFO L225 Difference]: With dead ends: 72 [2020-11-30 02:20:51,351 INFO L226 Difference]: Without dead ends: 70 [2020-11-30 02:20:51,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:20:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-30 02:20:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2020-11-30 02:20:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 02:20:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2020-11-30 02:20:51,366 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 10 [2020-11-30 02:20:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:51,366 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2020-11-30 02:20:51,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:20:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2020-11-30 02:20:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 02:20:51,367 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:51,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:51,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 02:20:51,368 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:51,368 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2020-11-30 02:20:51,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:51,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402819974] [2020-11-30 02:20:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:51,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402819974] [2020-11-30 02:20:51,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:51,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:20:51,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146640764] [2020-11-30 02:20:51,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:20:51,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:20:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:20:51,413 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 4 states. [2020-11-30 02:20:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:51,471 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-11-30 02:20:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:20:51,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-30 02:20:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:51,477 INFO L225 Difference]: With dead ends: 54 [2020-11-30 02:20:51,477 INFO L226 Difference]: Without dead ends: 52 [2020-11-30 02:20:51,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:20:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-30 02:20:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-11-30 02:20:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-30 02:20:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2020-11-30 02:20:51,485 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 11 [2020-11-30 02:20:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:51,485 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-11-30 02:20:51,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:20:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-11-30 02:20:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 02:20:51,486 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:51,486 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:51,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 02:20:51,486 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2020-11-30 02:20:51,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:51,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153809571] [2020-11-30 02:20:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:51,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153809571] [2020-11-30 02:20:51,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679104855] [2020-11-30 02:20:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:51,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:20:51,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:51,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:51,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075516404] [2020-11-30 02:20:51,630 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 02:20:51,630 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:51,630 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:51,630 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:51,631 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:51,995 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:20:52,460 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2020-11-30 02:20:52,842 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2020-11-30 02:20:53,069 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:20:53,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:53,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2020-11-30 02:20:53,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526508068] [2020-11-30 02:20:53,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:20:53,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:20:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:20:53,071 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 6 states. [2020-11-30 02:20:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:53,147 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2020-11-30 02:20:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:20:53,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-30 02:20:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:53,149 INFO L225 Difference]: With dead ends: 118 [2020-11-30 02:20:53,149 INFO L226 Difference]: Without dead ends: 117 [2020-11-30 02:20:53,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:20:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-30 02:20:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-11-30 02:20:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-30 02:20:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-11-30 02:20:53,174 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 12 [2020-11-30 02:20:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:53,175 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-11-30 02:20:53,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:20:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-11-30 02:20:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 02:20:53,176 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:53,176 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:53,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-30 02:20:53,395 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash -930171701, now seen corresponding path program 1 times [2020-11-30 02:20:53,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:53,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919990965] [2020-11-30 02:20:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:20:53,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919990965] [2020-11-30 02:20:53,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:20:53,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:20:53,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179581994] [2020-11-30 02:20:53,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:20:53,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:53,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:20:53,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:20:53,421 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 4 states. [2020-11-30 02:20:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:53,475 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2020-11-30 02:20:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:20:53,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-30 02:20:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:53,476 INFO L225 Difference]: With dead ends: 94 [2020-11-30 02:20:53,476 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 02:20:53,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:20:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 02:20:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-11-30 02:20:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-30 02:20:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2020-11-30 02:20:53,486 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 14 [2020-11-30 02:20:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:53,486 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2020-11-30 02:20:53,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:20:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2020-11-30 02:20:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:20:53,496 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:53,496 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:53,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-30 02:20:53,497 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:53,497 INFO L82 PathProgramCache]: Analyzing trace with hash -541857789, now seen corresponding path program 1 times [2020-11-30 02:20:53,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:53,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499494215] [2020-11-30 02:20:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:53,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499494215] [2020-11-30 02:20:53,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164764820] [2020-11-30 02:20:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-11-30 02:20:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:53,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:20:53,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:53,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:53,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [101950440] [2020-11-30 02:20:53,612 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-11-30 02:20:53,612 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:53,612 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:53,613 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:53,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:53,834 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 02:20:53,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:53,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2020-11-30 02:20:53,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700731132] [2020-11-30 02:20:53,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:20:53,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:53,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:20:53,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:20:53,838 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 6 states. [2020-11-30 02:20:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:53,906 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2020-11-30 02:20:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:20:53,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-30 02:20:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:53,908 INFO L225 Difference]: With dead ends: 142 [2020-11-30 02:20:53,908 INFO L226 Difference]: Without dead ends: 99 [2020-11-30 02:20:53,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:20:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-30 02:20:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2020-11-30 02:20:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-30 02:20:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2020-11-30 02:20:53,920 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 16 [2020-11-30 02:20:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:53,920 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2020-11-30 02:20:53,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:20:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2020-11-30 02:20:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:20:53,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:53,921 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:54,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-11-30 02:20:54,147 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -735760783, now seen corresponding path program 2 times [2020-11-30 02:20:54,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:54,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108416809] [2020-11-30 02:20:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:20:54,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108416809] [2020-11-30 02:20:54,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112924675] [2020-11-30 02:20:54,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:54,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-11-30 02:20:54,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:20:54,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:20:54,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:20:54,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:20:54,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999915898] [2020-11-30 02:20:54,249 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-11-30 02:20:54,249 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:54,249 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:54,249 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:54,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:54,430 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 02:20:54,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:54,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2020-11-30 02:20:54,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924557690] [2020-11-30 02:20:54,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:20:54,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:20:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:20:54,432 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 4 states. [2020-11-30 02:20:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:54,478 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2020-11-30 02:20:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:20:54,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-30 02:20:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:54,479 INFO L225 Difference]: With dead ends: 95 [2020-11-30 02:20:54,479 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 02:20:54,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:20:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 02:20:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-30 02:20:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-30 02:20:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2020-11-30 02:20:54,494 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 16 [2020-11-30 02:20:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:54,502 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2020-11-30 02:20:54,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:20:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2020-11-30 02:20:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:20:54,503 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:54,503 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:54,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:54,719 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash 471236851, now seen corresponding path program 1 times [2020-11-30 02:20:54,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:54,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720984087] [2020-11-30 02:20:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:54,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720984087] [2020-11-30 02:20:54,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001791303] [2020-11-30 02:20:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:54,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:20:54,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:54,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:54,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1380274284] [2020-11-30 02:20:54,872 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-11-30 02:20:54,872 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:54,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:54,873 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:54,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:55,082 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 02:20:55,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:55,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2020-11-30 02:20:55,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855862902] [2020-11-30 02:20:55,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:20:55,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:55,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:20:55,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:20:55,084 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 10 states. [2020-11-30 02:20:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:55,509 INFO L93 Difference]: Finished difference Result 442 states and 524 transitions. [2020-11-30 02:20:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-30 02:20:55,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-11-30 02:20:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:55,512 INFO L225 Difference]: With dead ends: 442 [2020-11-30 02:20:55,513 INFO L226 Difference]: Without dead ends: 441 [2020-11-30 02:20:55,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2020-11-30 02:20:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-30 02:20:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 200. [2020-11-30 02:20:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-30 02:20:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 244 transitions. [2020-11-30 02:20:55,532 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 244 transitions. Word has length 17 [2020-11-30 02:20:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:55,532 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 244 transitions. [2020-11-30 02:20:55,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:20:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 244 transitions. [2020-11-30 02:20:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 02:20:55,534 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:55,534 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:20:55,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-11-30 02:20:55,747 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash 467352042, now seen corresponding path program 2 times [2020-11-30 02:20:55,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:55,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093329824] [2020-11-30 02:20:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:20:55,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093329824] [2020-11-30 02:20:55,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121261908] [2020-11-30 02:20:55,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:55,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 02:20:55,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:20:55,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:20:55,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 02:20:55,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 02:20:55,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538124603] [2020-11-30 02:20:56,000 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-11-30 02:20:56,001 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:56,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:56,001 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:56,001 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:56,184 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 02:20:56,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:56,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2020-11-30 02:20:56,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888777122] [2020-11-30 02:20:56,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 02:20:56,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 02:20:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:20:56,186 INFO L87 Difference]: Start difference. First operand 200 states and 244 transitions. Second operand 13 states. [2020-11-30 02:20:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:56,816 INFO L93 Difference]: Finished difference Result 699 states and 853 transitions. [2020-11-30 02:20:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-30 02:20:56,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2020-11-30 02:20:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:56,821 INFO L225 Difference]: With dead ends: 699 [2020-11-30 02:20:56,821 INFO L226 Difference]: Without dead ends: 698 [2020-11-30 02:20:56,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=449, Invalid=883, Unknown=0, NotChecked=0, Total=1332 [2020-11-30 02:20:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-11-30 02:20:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 244. [2020-11-30 02:20:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-11-30 02:20:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2020-11-30 02:20:56,851 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 32 [2020-11-30 02:20:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:56,851 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2020-11-30 02:20:56,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 02:20:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2020-11-30 02:20:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:20:56,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:56,855 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2020-11-30 02:20:57,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:57,071 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash -538753878, now seen corresponding path program 2 times [2020-11-30 02:20:57,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:57,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454247575] [2020-11-30 02:20:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-30 02:20:57,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454247575] [2020-11-30 02:20:57,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154144008] [2020-11-30 02:20:57,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:57,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-11-30 02:20:57,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:20:57,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 02:20:57,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-30 02:20:57,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-30 02:20:57,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1878987590] [2020-11-30 02:20:57,163 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-11-30 02:20:57,163 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:57,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:57,164 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:57,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:57,291 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:20:57,605 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2020-11-30 02:20:57,780 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2020-11-30 02:20:58,068 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:20:58,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:58,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2020-11-30 02:20:58,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874042663] [2020-11-30 02:20:58,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:20:58,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:20:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:20:58,070 INFO L87 Difference]: Start difference. First operand 244 states and 300 transitions. Second operand 4 states. [2020-11-30 02:20:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:58,106 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2020-11-30 02:20:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:20:58,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 02:20:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:58,108 INFO L225 Difference]: With dead ends: 244 [2020-11-30 02:20:58,108 INFO L226 Difference]: Without dead ends: 243 [2020-11-30 02:20:58,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:20:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-11-30 02:20:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 76. [2020-11-30 02:20:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-30 02:20:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2020-11-30 02:20:58,120 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 33 [2020-11-30 02:20:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:58,122 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2020-11-30 02:20:58,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:20:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2020-11-30 02:20:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 02:20:58,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:58,126 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2020-11-30 02:20:58,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2020-11-30 02:20:58,339 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -738627734, now seen corresponding path program 1 times [2020-11-30 02:20:58,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:58,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962157894] [2020-11-30 02:20:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 02:20:58,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962157894] [2020-11-30 02:20:58,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194815285] [2020-11-30 02:20:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:58,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:20:58,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:20:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 02:20:58,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 02:20:58,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:20:58,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2020-11-30 02:20:58,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597458263] [2020-11-30 02:20:58,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:20:58,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:20:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:20:58,589 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 8 states. [2020-11-30 02:20:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:20:58,758 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2020-11-30 02:20:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:20:58,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-11-30 02:20:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:20:58,760 INFO L225 Difference]: With dead ends: 193 [2020-11-30 02:20:58,760 INFO L226 Difference]: Without dead ends: 132 [2020-11-30 02:20:58,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-30 02:20:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-30 02:20:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2020-11-30 02:20:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-30 02:20:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2020-11-30 02:20:58,778 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 44 [2020-11-30 02:20:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:20:58,779 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2020-11-30 02:20:58,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:20:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2020-11-30 02:20:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 02:20:58,781 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:20:58,781 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2020-11-30 02:20:58,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable181 [2020-11-30 02:20:58,995 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-11-30 02:20:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:20:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash -37887510, now seen corresponding path program 2 times [2020-11-30 02:20:58,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:20:58,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473717108] [2020-11-30 02:20:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:20:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:20:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:20:59,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473717108] [2020-11-30 02:20:59,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091457545] [2020-11-30 02:20:59,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-11-30 02:20:59,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 02:20:59,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:20:59,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:20:59,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:20:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-11-30 02:20:59,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:20:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-11-30 02:20:59,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [720576167] [2020-11-30 02:20:59,238 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-11-30 02:20:59,240 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:20:59,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:20:59,241 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:20:59,241 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:20:59,644 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 02:20:59,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:20:59,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 13 [2020-11-30 02:20:59,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404471793] [2020-11-30 02:20:59,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 02:20:59,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:20:59,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 02:20:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-30 02:20:59,646 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 14 states. [2020-11-30 02:21:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:21:00,165 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2020-11-30 02:21:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 02:21:00,165 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2020-11-30 02:21:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:21:00,166 INFO L225 Difference]: With dead ends: 187 [2020-11-30 02:21:00,166 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 02:21:00,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2020-11-30 02:21:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 02:21:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 02:21:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 02:21:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 02:21:00,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2020-11-30 02:21:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:21:00,169 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 02:21:00,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 02:21:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 02:21:00,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 02:21:00,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:21:00,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 02:21:00,494 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2020-11-30 02:21:00,707 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 120 [2020-11-30 02:21:01,244 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 235 [2020-11-30 02:21:01,629 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 27 [2020-11-30 02:21:02,214 WARN L193 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 36 [2020-11-30 02:21:03,032 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 35 [2020-11-30 02:21:03,038 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2020-11-30 02:21:03,038 INFO L270 CegarLoopResult]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse5 (<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)) (.cse0 (<= 0 ULTIMATE.start_main_~i~0)) (.cse6 (<= 0 ULTIMATE.start_main_~j~0)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse3 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse4 (<= ULTIMATE.start_main_~n~0 2147483647))) (or (and .cse0 (<= ULTIMATE.start_main_~i~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse6 .cse1 .cse2 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse3 (<= ULTIMATE.start_main_~j~0 0) .cse4))) [2020-11-30 02:21:03,038 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2020-11-30 02:21:03,038 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2020-11-30 02:21:03,038 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L270 CegarLoopResult]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_main_~n~0 2147483647))) (let ((.cse0 (let ((.cse3 (<= 0 ULTIMATE.start_main_~i~0)) (.cse4 (<= 0 ULTIMATE.start_main_~j~0)) (.cse5 (<= 0 ULTIMATE.start_main_~N~0)) (.cse6 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~k~0))) (or (and .cse3 .cse4 .cse5 (< ULTIMATE.start_main_~k~0 2147483647) .cse6 .cse2 .cse7) (and .cse3 .cse4 (<= ULTIMATE.start_main_~i~0 2147483646) (<= ULTIMATE.start_main_~k~0 2147483646) .cse5 .cse6 .cse7)))) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647))) (or (and .cse0 (<= ULTIMATE.start_main_~i~0 0) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse2 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)))))) [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-11-30 02:21:03,039 INFO L274 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-11-30 02:21:03,040 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2020-11-30 02:21:03,040 INFO L270 CegarLoopResult]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~i~0)) (.cse7 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse1 (<= 0 ULTIMATE.start_main_~j~0)) (.cse2 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse3 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse4 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (.cse5 (<= 0 ULTIMATE.start_main_~N~0)) (.cse6 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse8 (<= ULTIMATE.start_main_~j~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~k~0 2147483646) .cse4 .cse5 .cse6 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= 0 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 0) .cse3 .cse5 .cse7 .cse8 .cse6) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~m~0 0) .cse5 .cse7 .cse6 .cse8) (and (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8))) [2020-11-30 02:21:03,041 INFO L274 CegarLoopResult]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2020-11-30 02:21:03,042 INFO L274 CegarLoopResult]: For program point L21(lines 21 35) no Hoare annotation was computed. [2020-11-30 02:21:03,043 INFO L277 CegarLoopResult]: At program point L21-1(lines 21 35) the Hoare annotation is: true [2020-11-30 02:21:03,043 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2020-11-30 02:21:03,043 INFO L274 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-11-30 02:21:03,043 INFO L274 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2020-11-30 02:21:03,044 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2020-11-30 02:21:03,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:21:03 BoogieIcfgContainer [2020-11-30 02:21:03,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:21:03,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:21:03,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:21:03,103 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:21:03,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:20:48" (3/4) ... [2020-11-30 02:21:03,106 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 02:21:03,116 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-11-30 02:21:03,116 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-11-30 02:21:03,117 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 02:21:03,161 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d100fa6f-2129-4275-be67-93a60f2c2fe2/bin/utaipan/witness.graphml [2020-11-30 02:21:03,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:21:03,163 INFO L168 Benchmark]: Toolchain (without parser) took 15531.40 ms. Allocated memory was 107.0 MB in the beginning and 192.9 MB in the end (delta: 86.0 MB). Free memory was 77.8 MB in the beginning and 85.3 MB in the end (delta: -7.5 MB). Peak memory consumption was 77.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:21:03,163 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 81.8 MB. Free memory was 43.5 MB in the beginning and 43.5 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:21:03,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.30 ms. Allocated memory is still 107.0 MB. Free memory was 77.5 MB in the beginning and 86.3 MB in the end (delta: -8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:21:03,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.27 ms. Allocated memory is still 107.0 MB. Free memory was 86.3 MB in the beginning and 84.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:21:03,165 INFO L168 Benchmark]: Boogie Preprocessor took 40.35 ms. Allocated memory is still 107.0 MB. Free memory was 84.8 MB in the beginning and 84.0 MB in the end (delta: 800.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:21:03,165 INFO L168 Benchmark]: RCFGBuilder took 506.16 ms. Allocated memory is still 107.0 MB. Free memory was 83.6 MB in the beginning and 71.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:21:03,166 INFO L168 Benchmark]: TraceAbstraction took 14561.54 ms. Allocated memory was 107.0 MB in the beginning and 192.9 MB in the end (delta: 86.0 MB). Free memory was 70.6 MB in the beginning and 88.4 MB in the end (delta: -17.8 MB). Peak memory consumption was 103.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:21:03,166 INFO L168 Benchmark]: Witness Printer took 69.04 ms. Allocated memory is still 192.9 MB. Free memory was 88.4 MB in the beginning and 85.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:21:03,169 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.24 ms. Allocated memory is still 81.8 MB. Free memory was 43.5 MB in the beginning and 43.5 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.30 ms. Allocated memory is still 107.0 MB. Free memory was 77.5 MB in the beginning and 86.3 MB in the end (delta: -8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.27 ms. Allocated memory is still 107.0 MB. Free memory was 86.3 MB in the beginning and 84.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.35 ms. Allocated memory is still 107.0 MB. Free memory was 84.8 MB in the beginning and 84.0 MB in the end (delta: 800.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 506.16 ms. Allocated memory is still 107.0 MB. Free memory was 83.6 MB in the beginning and 71.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14561.54 ms. Allocated memory was 107.0 MB in the beginning and 192.9 MB in the end (delta: 86.0 MB). Free memory was 70.6 MB in the beginning and 88.4 MB in the end (delta: -17.8 MB). Peak memory consumption was 103.9 MB. Max. memory is 16.1 GB. * Witness Printer took 69.04 ms. Allocated memory is still 192.9 MB. Free memory was 88.4 MB in the beginning and 85.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: 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: 28]: 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((0 <= i && i <= 0) && m <= 2147483647) && 0 <= N) && N <= 2147483647) && n <= 2147483647) || (((((((m <= j && N <= i) && 0 <= j) && m <= 2147483647) && 0 <= N) && N <= k + 1) && N <= 2147483647) && n <= 2147483647)) || ((((((m <= j && 0 <= i) && 0 <= j) && 0 <= N) && N <= 2147483647) && j <= 0) && n <= 2147483647) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((((0 <= i && 0 <= j) && i <= 2147483646) && m <= 2147483647) && k <= 2147483646) && N <= k + 1) && 0 <= N) && n <= 2147483647) && N <= i + 1) && 0 <= k) || (((((((0 <= i && 0 <= j) && i <= 0) && m <= 2147483647) && 0 <= N) && N <= 2147483647) && j <= 0) && n <= 2147483647)) || (((((((0 <= i && 0 <= j) && i <= 2147483646) && m <= 0) && 0 <= N) && N <= 2147483647) && n <= 2147483647) && j <= 0)) || (((((((N <= i && 0 <= j) && i <= 2147483646) && m <= 2147483647) && N <= k + 1) && 0 <= N) && n <= 2147483647) && j <= 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((((0 <= i && 0 <= j) && 0 <= N) && k < 2147483647) && N <= 2147483647) && n <= 2147483647) && 0 <= k) || ((((((0 <= i && 0 <= j) && i <= 2147483646) && k <= 2147483646) && 0 <= N) && N <= 2147483647) && 0 <= k)) && i <= 0) && m <= 2147483647) && n <= 2147483647) || (((((((((((0 <= i && 0 <= j) && 0 <= N) && k < 2147483647) && N <= 2147483647) && n <= 2147483647) && 0 <= k) || ((((((0 <= i && 0 <= j) && i <= 2147483646) && k <= 2147483646) && 0 <= N) && N <= 2147483647) && 0 <= k)) && m <= 2147483647) && N <= k + 1) && n <= 2147483647) && N <= i + 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.7s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 275 SDtfs, 1114 SDslu, 434 SDs, 0 SdLazy, 649 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 448 SyntacticMatches, 14 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 66 NumberOfFragments, 301 HoareAnnotationTreeSize, 4 FomulaSimplifications, 329874 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 76526 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 518 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 54959 SizeOfPredicates, 23 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 413/716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...