./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/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 c57ebc44b313bf301635c00d4458ecfdd41286b1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:21:25,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:21:25,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:21:25,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:21:25,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:21:25,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:21:25,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:21:25,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:21:25,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:21:25,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:21:25,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:21:25,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:21:25,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:21:25,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:21:25,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:21:25,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:21:25,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:21:25,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:21:25,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:21:25,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:21:25,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:21:25,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:21:25,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:21:25,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:21:25,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:21:25,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:21:25,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:21:25,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:21:25,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:21:25,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:21:25,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:21:25,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:21:25,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:21:25,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:21:25,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:21:25,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:21:25,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:21:25,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:21:25,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:21:25,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:21:25,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:21:25,413 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-12-07 21:21:25,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:21:25,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:21:25,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:21:25,424 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:21:25,424 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:21:25,424 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:21:25,424 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:21:25,424 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:21:25,425 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:21:25,425 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:21:25,425 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:21:25,425 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:21:25,425 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:21:25,425 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:21:25,425 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:21:25,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:21:25,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:21:25,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:21:25,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:21:25,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:21:25,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:21:25,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:21:25,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:21:25,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:21:25,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:21:25,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:21:25,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:21:25,428 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:21:25,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:21:25,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:21:25,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:21:25,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:21:25,429 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_37bc4324-38d1-435b-8547-6712de934951/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 -> c57ebc44b313bf301635c00d4458ecfdd41286b1 [2019-12-07 21:21:25,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:21:25,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:21:25,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:21:25,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:21:25,543 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:21:25,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/../../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2019-12-07 21:21:25,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/data/ee7031a84/58f7199f05dd4d79b210cfaa3cb468ec/FLAGcb6cf32cd [2019-12-07 21:21:26,101 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:21:26,101 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2019-12-07 21:21:26,114 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/data/ee7031a84/58f7199f05dd4d79b210cfaa3cb468ec/FLAGcb6cf32cd [2019-12-07 21:21:26,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/bin/utaipan/data/ee7031a84/58f7199f05dd4d79b210cfaa3cb468ec [2019-12-07 21:21:26,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:21:26,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:21:26,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:26,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:21:26,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:21:26,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:26" (1/1) ... [2019-12-07 21:21:26,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6129ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:26, skipping insertion in model container [2019-12-07 21:21:26,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:26" (1/1) ... [2019-12-07 21:21:26,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:21:26,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:21:27,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:27,014 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:21:27,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:27,176 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:21:27,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27 WrapperNode [2019-12-07 21:21:27,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:27,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:27,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:21:27,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:21:27,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:27,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:21:27,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:21:27,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:21:27,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... [2019-12-07 21:21:27,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:21:27,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:21:27,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:21:27,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:21:27,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/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 [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 21:21:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 21:21:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:21:27,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:21:28,222 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:21:28,222 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 21:21:28,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:28 BoogieIcfgContainer [2019-12-07 21:21:28,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:21:28,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:21:28,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:21:28,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:21:28,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:21:26" (1/3) ... [2019-12-07 21:21:28,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a88e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:28, skipping insertion in model container [2019-12-07 21:21:28,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:27" (2/3) ... [2019-12-07 21:21:28,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a88e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:28, skipping insertion in model container [2019-12-07 21:21:28,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:28" (3/3) ... [2019-12-07 21:21:28,228 INFO L109 eAbstractionObserver]: Analyzing ICFG basename-2.i [2019-12-07 21:21:28,235 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:21:28,240 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-12-07 21:21:28,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-12-07 21:21:28,263 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:21:28,263 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:21:28,263 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:21:28,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:21:28,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:21:28,264 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:21:28,264 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:21:28,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:21:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-12-07 21:21:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:21:28,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:28,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:21:28,282 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash 366463, now seen corresponding path program 1 times [2019-12-07 21:21:28,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:28,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441036753] [2019-12-07 21:21:28,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:28,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441036753] [2019-12-07 21:21:28,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:28,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:28,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721194428] [2019-12-07 21:21:28,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:28,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:28,514 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-12-07 21:21:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:28,562 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2019-12-07 21:21:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:28,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:21:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:28,574 INFO L225 Difference]: With dead ends: 173 [2019-12-07 21:21:28,575 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 21:21:28,578 INFO L630 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 [2019-12-07 21:21:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 21:21:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-07 21:21:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 21:21:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-12-07 21:21:28,607 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 3 [2019-12-07 21:21:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:28,607 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-12-07 21:21:28,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-12-07 21:21:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 21:21:28,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:28,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 21:21:28,608 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:28,609 INFO L82 PathProgramCache]: Analyzing trace with hash 11360398, now seen corresponding path program 1 times [2019-12-07 21:21:28,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:28,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147659487] [2019-12-07 21:21:28,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:28,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147659487] [2019-12-07 21:21:28,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:28,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:21:28,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792534994] [2019-12-07 21:21:28,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:28,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:28,692 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 3 states. [2019-12-07 21:21:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:28,716 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-12-07 21:21:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:28,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 21:21:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:28,717 INFO L225 Difference]: With dead ends: 91 [2019-12-07 21:21:28,718 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 21:21:28,718 INFO L630 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 [2019-12-07 21:21:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 21:21:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 21:21:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 21:21:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-12-07 21:21:28,725 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 4 [2019-12-07 21:21:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:28,725 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-12-07 21:21:28,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-12-07 21:21:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:21:28,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:28,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:21:28,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1967547083, now seen corresponding path program 1 times [2019-12-07 21:21:28,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:28,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677083506] [2019-12-07 21:21:28,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:28,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677083506] [2019-12-07 21:21:28,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:28,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:28,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264852144] [2019-12-07 21:21:28,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:28,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:28,774 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 3 states. [2019-12-07 21:21:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:28,822 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-12-07 21:21:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:28,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 21:21:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:28,823 INFO L225 Difference]: With dead ends: 90 [2019-12-07 21:21:28,823 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 21:21:28,823 INFO L630 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 [2019-12-07 21:21:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 21:21:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-07 21:21:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 21:21:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-12-07 21:21:28,829 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 6 [2019-12-07 21:21:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:28,829 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-12-07 21:21:28,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2019-12-07 21:21:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:21:28,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:28,830 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-12-07 21:21:28,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -864759748, now seen corresponding path program 1 times [2019-12-07 21:21:28,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:28,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104531339] [2019-12-07 21:21:28,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:28,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104531339] [2019-12-07 21:21:28,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:28,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:28,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819483795] [2019-12-07 21:21:28,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:28,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:28,878 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand 3 states. [2019-12-07 21:21:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:28,897 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2019-12-07 21:21:28,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:28,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 21:21:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:28,898 INFO L225 Difference]: With dead ends: 86 [2019-12-07 21:21:28,898 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 21:21:28,899 INFO L630 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 [2019-12-07 21:21:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 21:21:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-12-07 21:21:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 21:21:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2019-12-07 21:21:28,904 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 7 [2019-12-07 21:21:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:28,904 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2019-12-07 21:21:28,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2019-12-07 21:21:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:21:28,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:28,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:28,905 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -864417376, now seen corresponding path program 1 times [2019-12-07 21:21:28,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:28,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959093644] [2019-12-07 21:21:28,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:28,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959093644] [2019-12-07 21:21:28,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:28,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:28,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341675257] [2019-12-07 21:21:28,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:28,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:28,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:28,947 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. Second operand 3 states. [2019-12-07 21:21:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:28,994 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-12-07 21:21:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:28,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 21:21:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:28,995 INFO L225 Difference]: With dead ends: 83 [2019-12-07 21:21:28,995 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 21:21:28,996 INFO L630 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 [2019-12-07 21:21:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 21:21:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 21:21:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 21:21:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-12-07 21:21:29,002 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 7 [2019-12-07 21:21:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:29,002 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-12-07 21:21:29,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-12-07 21:21:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:21:29,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:29,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:29,003 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2017155110, now seen corresponding path program 1 times [2019-12-07 21:21:29,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:29,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541635656] [2019-12-07 21:21:29,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:29,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541635656] [2019-12-07 21:21:29,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:29,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:29,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791521867] [2019-12-07 21:21:29,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:29,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:29,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:29,070 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 3 states. [2019-12-07 21:21:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:29,097 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2019-12-07 21:21:29,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:29,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 21:21:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:29,099 INFO L225 Difference]: With dead ends: 145 [2019-12-07 21:21:29,099 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 21:21:29,100 INFO L630 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 [2019-12-07 21:21:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 21:21:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 21:21:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 21:21:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-12-07 21:21:29,106 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 16 [2019-12-07 21:21:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:29,106 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-12-07 21:21:29,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-12-07 21:21:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:21:29,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:29,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:29,107 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1882413184, now seen corresponding path program 1 times [2019-12-07 21:21:29,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:29,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866092788] [2019-12-07 21:21:29,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:29,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866092788] [2019-12-07 21:21:29,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:29,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:21:29,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463588798] [2019-12-07 21:21:29,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:21:29,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:29,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:21:29,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:29,198 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 4 states. [2019-12-07 21:21:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:29,274 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2019-12-07 21:21:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:21:29,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 21:21:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:29,275 INFO L225 Difference]: With dead ends: 145 [2019-12-07 21:21:29,275 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 21:21:29,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:21:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 21:21:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-12-07 21:21:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 21:21:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2019-12-07 21:21:29,281 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 17 [2019-12-07 21:21:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:29,281 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2019-12-07 21:21:29,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:21:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2019-12-07 21:21:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:21:29,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:29,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:29,282 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1892700944, now seen corresponding path program 1 times [2019-12-07 21:21:29,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:29,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283757040] [2019-12-07 21:21:29,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:29,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283757040] [2019-12-07 21:21:29,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:29,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:29,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011042742] [2019-12-07 21:21:29,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:29,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:29,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:29,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:29,328 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 3 states. [2019-12-07 21:21:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:29,355 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2019-12-07 21:21:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:29,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 21:21:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:29,356 INFO L225 Difference]: With dead ends: 91 [2019-12-07 21:21:29,356 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 21:21:29,357 INFO L630 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 [2019-12-07 21:21:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 21:21:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 21:21:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 21:21:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-12-07 21:21:29,361 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 17 [2019-12-07 21:21:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:29,362 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-12-07 21:21:29,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-12-07 21:21:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:21:29,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:29,362 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:29,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1123080285, now seen corresponding path program 1 times [2019-12-07 21:21:29,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:29,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609749460] [2019-12-07 21:21:29,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:29,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609749460] [2019-12-07 21:21:29,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:21:29,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:21:29,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180797624] [2019-12-07 21:21:29,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:21:29,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:21:29,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:21:29,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:21:29,409 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 3 states. [2019-12-07 21:21:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:29,432 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-12-07 21:21:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:21:29,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:21:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:29,433 INFO L225 Difference]: With dead ends: 90 [2019-12-07 21:21:29,433 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 21:21:29,434 INFO L630 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 [2019-12-07 21:21:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 21:21:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-12-07 21:21:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 21:21:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2019-12-07 21:21:29,438 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 20 [2019-12-07 21:21:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:29,438 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2019-12-07 21:21:29,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:21:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2019-12-07 21:21:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:21:29,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:29,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:29,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:21:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1229562416, now seen corresponding path program 1 times [2019-12-07 21:21:29,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:21:29,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477442068] [2019-12-07 21:21:29,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:21:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:29,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477442068] [2019-12-07 21:21:29,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896920771] [2019-12-07 21:21:29,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37bc4324-38d1-435b-8547-6712de934951/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 [2019-12-07 21:21:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:29,652 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:21:29,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:21:29,693 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:21:29,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2082019347] [2019-12-07 21:21:29,746 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-12-07 21:21:29,747 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:21:29,752 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:21:29,758 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:21:29,759 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:21:30,894 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 113 [2019-12-07 21:21:31,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:31,130 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:557) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:21:31,139 INFO L168 Benchmark]: Toolchain (without parser) took 4570.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -93.4 MB). Peak memory consumption was 219.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:31,140 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:21:31,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 938.0 MB in the beginning and 997.6 MB in the end (delta: -59.6 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:31,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.42 ms. Allocated memory is still 1.1 GB. Free memory was 997.6 MB in the beginning and 992.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:31,144 INFO L168 Benchmark]: Boogie Preprocessor took 42.05 ms. Allocated memory is still 1.1 GB. Free memory is still 992.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:21:31,146 INFO L168 Benchmark]: RCFGBuilder took 950.52 ms. Allocated memory is still 1.1 GB. Free memory was 992.2 MB in the beginning and 856.0 MB in the end (delta: 136.2 MB). Peak memory consumption was 136.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:31,147 INFO L168 Benchmark]: TraceAbstraction took 2912.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 856.0 MB in the beginning and 1.0 GB in the end (delta: -175.4 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:21:31,155 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 938.0 MB in the beginning and 997.6 MB in the end (delta: -59.6 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.42 ms. Allocated memory is still 1.1 GB. Free memory was 997.6 MB in the beginning and 992.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.05 ms. Allocated memory is still 1.1 GB. Free memory is still 992.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 950.52 ms. Allocated memory is still 1.1 GB. Free memory was 992.2 MB in the beginning and 856.0 MB in the end (delta: 136.2 MB). Peak memory consumption was 136.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2912.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 856.0 MB in the beginning and 1.0 GB in the end (delta: -175.4 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...