./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0b85db7f19d029ed27be7f6b92a191abc3110f8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:47:09,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:47:09,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:47:09,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:47:09,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:47:09,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:47:09,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:47:09,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:47:09,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:47:09,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:47:09,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:47:09,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:47:09,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:47:09,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:47:09,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:47:09,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:47:09,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:47:09,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:47:09,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:47:09,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:47:09,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:47:09,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:47:09,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:47:09,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:47:09,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:47:09,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:47:09,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:47:09,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:47:09,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:47:09,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:47:09,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:47:09,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:47:09,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:47:09,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:47:09,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:47:09,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:47:09,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:47:09,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:47:09,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:47:09,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:47:09,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:47:09,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:47:09,440 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:47:09,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:47:09,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:47:09,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:47:09,442 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:47:09,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:47:09,443 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:47:09,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:47:09,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:47:09,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:47:09,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:47:09,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:47:09,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:47:09,446 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:47:09,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:47:09,447 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:47:09,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:47:09,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:47:09,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:47:09,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:47:09,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:47:09,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:47:09,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:47:09,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:47:09,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:47:09,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:47:09,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:47:09,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:47:09,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:47:09,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0b85db7f19d029ed27be7f6b92a191abc3110f8 [2020-10-20 00:47:09,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:47:09,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:47:09,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:47:09,676 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:47:09,676 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:47:09,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-20 00:47:09,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2eedb1d0/9a6021d3f95048caae260866eb62e4cd/FLAG937b2e98d [2020-10-20 00:47:10,379 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:47:10,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-20 00:47:10,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2eedb1d0/9a6021d3f95048caae260866eb62e4cd/FLAG937b2e98d [2020-10-20 00:47:10,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2eedb1d0/9a6021d3f95048caae260866eb62e4cd [2020-10-20 00:47:10,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:47:10,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:47:10,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:47:10,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:47:10,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:47:10,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:47:10" (1/1) ... [2020-10-20 00:47:10,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2c955e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:10, skipping insertion in model container [2020-10-20 00:47:10,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:47:10" (1/1) ... [2020-10-20 00:47:10,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:47:10,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:47:11,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:47:11,165 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:47:11,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:47:11,273 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:47:11,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11 WrapperNode [2020-10-20 00:47:11,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:47:11,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:47:11,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:47:11,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:47:11,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:47:11,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:47:11,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:47:11,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:47:11,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... [2020-10-20 00:47:11,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:47:11,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:47:11,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:47:11,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:47:11,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:11,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 00:47:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 00:47:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 00:47:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 00:47:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:47:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 00:47:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:47:11,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:47:11,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:47:11,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:47:12,014 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:47:12,014 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-20 00:47:12,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:47:12 BoogieIcfgContainer [2020-10-20 00:47:12,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:47:12,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:47:12,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:47:12,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:47:12,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:47:10" (1/3) ... [2020-10-20 00:47:12,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b16a595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:47:12, skipping insertion in model container [2020-10-20 00:47:12,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:47:11" (2/3) ... [2020-10-20 00:47:12,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b16a595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:47:12, skipping insertion in model container [2020-10-20 00:47:12,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:47:12" (3/3) ... [2020-10-20 00:47:12,025 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-10-20 00:47:12,037 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:47:12,045 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 00:47:12,059 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 00:47:12,086 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:47:12,086 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:47:12,086 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:47:12,086 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:47:12,087 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:47:12,087 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:47:12,087 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:47:12,087 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:47:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-10-20 00:47:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:47:12,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:12,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:12,113 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1416944146, now seen corresponding path program 1 times [2020-10-20 00:47:12,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:12,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43756417] [2020-10-20 00:47:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:47:12,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43756417] [2020-10-20 00:47:12,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:12,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 00:47:12,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790314694] [2020-10-20 00:47:12,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:47:12,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:12,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:47:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:47:12,325 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2020-10-20 00:47:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:12,351 INFO L93 Difference]: Finished difference Result 103 states and 163 transitions. [2020-10-20 00:47:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:47:12,353 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2020-10-20 00:47:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:12,364 INFO L225 Difference]: With dead ends: 103 [2020-10-20 00:47:12,376 INFO L226 Difference]: Without dead ends: 45 [2020-10-20 00:47:12,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:47:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-20 00:47:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-20 00:47:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 00:47:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-10-20 00:47:12,427 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2020-10-20 00:47:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:12,428 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-10-20 00:47:12,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:47:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-10-20 00:47:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 00:47:12,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:12,429 INFO L422 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] [2020-10-20 00:47:12,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:47:12,430 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1171444280, now seen corresponding path program 1 times [2020-10-20 00:47:12,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:12,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219610091] [2020-10-20 00:47:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:47:12,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219610091] [2020-10-20 00:47:12,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:12,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:47:12,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363323362] [2020-10-20 00:47:12,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:47:12,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:47:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:47:12,524 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 3 states. [2020-10-20 00:47:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:12,547 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-10-20 00:47:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:47:12,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-20 00:47:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:12,550 INFO L225 Difference]: With dead ends: 75 [2020-10-20 00:47:12,551 INFO L226 Difference]: Without dead ends: 53 [2020-10-20 00:47:12,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-20 00:47:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-20 00:47:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-20 00:47:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 00:47:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2020-10-20 00:47:12,561 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 23 [2020-10-20 00:47:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:12,561 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2020-10-20 00:47:12,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:47:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2020-10-20 00:47:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 00:47:12,563 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:12,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:12,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:47:12,563 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1613486293, now seen corresponding path program 1 times [2020-10-20 00:47:12,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:12,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547585835] [2020-10-20 00:47:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:47:12,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547585835] [2020-10-20 00:47:12,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:12,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:47:12,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468477636] [2020-10-20 00:47:12,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:47:12,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:47:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:47:12,614 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 3 states. [2020-10-20 00:47:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:12,647 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2020-10-20 00:47:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:47:12,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-20 00:47:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:12,650 INFO L225 Difference]: With dead ends: 93 [2020-10-20 00:47:12,650 INFO L226 Difference]: Without dead ends: 55 [2020-10-20 00:47:12,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-20 00:47:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-20 00:47:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-20 00:47:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 00:47:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2020-10-20 00:47:12,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 29 [2020-10-20 00:47:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:12,659 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-10-20 00:47:12,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:47:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-10-20 00:47:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 00:47:12,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:12,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:12,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:47:12,662 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:12,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1832341011, now seen corresponding path program 1 times [2020-10-20 00:47:12,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:12,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672076371] [2020-10-20 00:47:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:12,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672076371] [2020-10-20 00:47:12,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:12,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:47:12,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968551393] [2020-10-20 00:47:12,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:47:12,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:12,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:47:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:47:12,782 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 5 states. [2020-10-20 00:47:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:12,953 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-10-20 00:47:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:47:12,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-10-20 00:47:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:12,955 INFO L225 Difference]: With dead ends: 84 [2020-10-20 00:47:12,955 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 00:47:12,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:47:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 00:47:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2020-10-20 00:47:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 00:47:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2020-10-20 00:47:12,965 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 29 [2020-10-20 00:47:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:12,965 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2020-10-20 00:47:12,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:47:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2020-10-20 00:47:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-20 00:47:12,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:12,969 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:12,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:47:12,970 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash -526312690, now seen corresponding path program 1 times [2020-10-20 00:47:12,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:12,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555840226] [2020-10-20 00:47:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:13,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555840226] [2020-10-20 00:47:13,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:13,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:47:13,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682631073] [2020-10-20 00:47:13,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:47:13,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:47:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:47:13,055 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand 5 states. [2020-10-20 00:47:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:13,182 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-10-20 00:47:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:47:13,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-10-20 00:47:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:13,184 INFO L225 Difference]: With dead ends: 86 [2020-10-20 00:47:13,184 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 00:47:13,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:47:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 00:47:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2020-10-20 00:47:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 00:47:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2020-10-20 00:47:13,193 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 31 [2020-10-20 00:47:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:13,193 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2020-10-20 00:47:13,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:47:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2020-10-20 00:47:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-20 00:47:13,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:13,195 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:13,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:47:13,196 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash 665736462, now seen corresponding path program 1 times [2020-10-20 00:47:13,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:13,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064782956] [2020-10-20 00:47:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:13,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064782956] [2020-10-20 00:47:13,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:13,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:47:13,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882308250] [2020-10-20 00:47:13,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:47:13,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:47:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:47:13,278 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand 5 states. [2020-10-20 00:47:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:13,405 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-10-20 00:47:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:47:13,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-10-20 00:47:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:13,407 INFO L225 Difference]: With dead ends: 86 [2020-10-20 00:47:13,407 INFO L226 Difference]: Without dead ends: 73 [2020-10-20 00:47:13,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:47:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-20 00:47:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2020-10-20 00:47:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 00:47:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2020-10-20 00:47:13,414 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2020-10-20 00:47:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:13,415 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2020-10-20 00:47:13,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:47:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-10-20 00:47:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 00:47:13,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:13,417 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:13,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:47:13,417 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1093383942, now seen corresponding path program 1 times [2020-10-20 00:47:13,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:13,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676172809] [2020-10-20 00:47:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:13,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676172809] [2020-10-20 00:47:13,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511086345] [2020-10-20 00:47:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:13,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-20 00:47:13,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:13,759 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:13,760 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,765 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 00:47:13,793 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,794 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:47:13,795 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,809 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:13,810 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,819 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-10-20 00:47:13,839 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:13,839 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 00:47:13,840 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-10-20 00:47:13,867 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 00:47:13,869 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:13,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-20 00:47:13,926 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-20 00:47:13,928 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:13,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:13,935 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-20 00:47:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:13,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:13,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 00:47:13,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595385350] [2020-10-20 00:47:13,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:47:13,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:47:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:47:13,943 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 9 states. [2020-10-20 00:47:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:14,229 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2020-10-20 00:47:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:47:14,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-10-20 00:47:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:14,230 INFO L225 Difference]: With dead ends: 88 [2020-10-20 00:47:14,231 INFO L226 Difference]: Without dead ends: 80 [2020-10-20 00:47:14,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:47:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-20 00:47:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2020-10-20 00:47:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 00:47:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2020-10-20 00:47:14,237 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 33 [2020-10-20 00:47:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:14,237 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2020-10-20 00:47:14,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:47:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2020-10-20 00:47:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 00:47:14,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:14,252 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:14,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-20 00:47:14,465 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -293072966, now seen corresponding path program 1 times [2020-10-20 00:47:14,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:14,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521760763] [2020-10-20 00:47:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:14,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521760763] [2020-10-20 00:47:14,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374635098] [2020-10-20 00:47:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:14,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-20 00:47:14,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:14,647 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:14,647 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,650 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,650 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 00:47:14,681 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,681 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:47:14,683 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,700 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:14,700 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,714 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-10-20 00:47:14,748 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:14,748 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 00:47:14,750 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,757 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,757 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,757 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-10-20 00:47:14,784 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 00:47:14,785 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,804 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:14,804 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-20 00:47:14,876 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-20 00:47:14,878 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:14,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:14,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-20 00:47:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:14,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:14,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 00:47:14,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305886000] [2020-10-20 00:47:14,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:47:14,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:47:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:47:14,901 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand 9 states. [2020-10-20 00:47:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:15,266 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2020-10-20 00:47:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:47:15,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-10-20 00:47:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:15,267 INFO L225 Difference]: With dead ends: 97 [2020-10-20 00:47:15,267 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 00:47:15,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:47:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 00:47:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2020-10-20 00:47:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 00:47:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2020-10-20 00:47:15,275 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 33 [2020-10-20 00:47:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:15,275 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2020-10-20 00:47:15,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:47:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2020-10-20 00:47:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 00:47:15,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:15,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:15,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:15,491 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2047331787, now seen corresponding path program 1 times [2020-10-20 00:47:15,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:15,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543869759] [2020-10-20 00:47:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:15,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543869759] [2020-10-20 00:47:15,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201815656] [2020-10-20 00:47:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:15,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-20 00:47:15,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:15,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:15,800 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,803 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:15,804 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,804 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 00:47:15,871 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:15,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:47:15,873 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:15,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-20 00:47:15,908 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-20 00:47:15,908 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:15,924 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-20 00:47:15,924 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:15,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-10-20 00:47:15,961 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2020-10-20 00:47:15,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-10-20 00:47:15,967 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:15,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:16,000 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:16,001 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2020-10-20 00:47:16,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-10-20 00:47:16,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 00:47:16,006 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,025 INFO L625 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-10-20 00:47:16,029 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2020-10-20 00:47:16,030 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:16,036 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,036 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-10-20 00:47:16,064 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-10-20 00:47:16,065 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:16,074 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 00:47:16,075 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,079 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:16,081 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-10-20 00:47:16,086 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 00:47:16,087 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:16,089 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:16,089 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 00:47:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:16,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:16,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-10-20 00:47:16,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794498048] [2020-10-20 00:47:16,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 00:47:16,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 00:47:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:47:16,110 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand 14 states. [2020-10-20 00:47:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:16,599 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2020-10-20 00:47:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:47:16,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-10-20 00:47:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:16,600 INFO L225 Difference]: With dead ends: 101 [2020-10-20 00:47:16,600 INFO L226 Difference]: Without dead ends: 95 [2020-10-20 00:47:16,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:47:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-20 00:47:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2020-10-20 00:47:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-20 00:47:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2020-10-20 00:47:16,608 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 35 [2020-10-20 00:47:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:16,609 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2020-10-20 00:47:16,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 00:47:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2020-10-20 00:47:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 00:47:16,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:16,610 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:16,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:16,825 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash -860258640, now seen corresponding path program 1 times [2020-10-20 00:47:16,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:16,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235982815] [2020-10-20 00:47:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:16,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235982815] [2020-10-20 00:47:16,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349140924] [2020-10-20 00:47:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:17,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-20 00:47:17,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:17,102 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:17,102 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,105 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,105 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 00:47:17,142 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,142 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:47:17,143 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-20 00:47:17,178 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-20 00:47:17,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,194 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-20 00:47:17,194 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,205 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-10-20 00:47:17,243 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_45|]} [2020-10-20 00:47:17,247 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-10-20 00:47:17,247 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,262 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2020-10-20 00:47:17,262 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,303 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,303 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2020-10-20 00:47:17,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-10-20 00:47:17,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 00:47:17,307 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,319 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-10-20 00:47:17,319 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,320 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-10-20 00:47:17,351 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-10-20 00:47:17,351 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,362 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 00:47:17,363 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,369 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,369 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-10-20 00:47:17,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 00:47:17,375 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:17,378 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:17,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 00:47:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:17,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:17,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-10-20 00:47:17,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885657309] [2020-10-20 00:47:17,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:47:17,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:47:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:47:17,404 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand 15 states. [2020-10-20 00:47:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:17,885 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2020-10-20 00:47:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:47:17,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-10-20 00:47:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:17,886 INFO L225 Difference]: With dead ends: 103 [2020-10-20 00:47:17,886 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 00:47:17,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:47:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 00:47:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2020-10-20 00:47:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 00:47:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2020-10-20 00:47:17,892 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 37 [2020-10-20 00:47:17,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:17,892 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2020-10-20 00:47:17,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:47:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2020-10-20 00:47:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 00:47:17,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:17,893 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:18,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:18,094 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash 331790512, now seen corresponding path program 2 times [2020-10-20 00:47:18,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:18,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200227903] [2020-10-20 00:47:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:18,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200227903] [2020-10-20 00:47:18,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207684565] [2020-10-20 00:47:18,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:18,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:47:18,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:47:18,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 36 conjunts are in the unsatisfiable core [2020-10-20 00:47:18,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:18,367 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:18,367 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,383 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 00:47:18,406 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,408 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:47:18,409 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,428 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,429 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-10-20 00:47:18,443 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:18,443 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:18,465 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,481 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,481 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-10-20 00:47:18,502 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_47|]} [2020-10-20 00:47:18,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-10-20 00:47:18,507 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,525 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2020-10-20 00:47:18,526 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,556 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 85 [2020-10-20 00:47:18,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-10-20 00:47:18,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 00:47:18,561 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,578 INFO L625 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2020-10-20 00:47:18,579 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,579 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-10-20 00:47:18,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-10-20 00:47:18,608 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-10-20 00:47:18,620 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,626 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,627 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-10-20 00:47:18,631 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 00:47:18,632 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:18,634 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:18,634 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 00:47:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:18,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:18,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-20 00:47:18,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819350455] [2020-10-20 00:47:18,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 00:47:18,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 00:47:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:47:18,669 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 11 states. [2020-10-20 00:47:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:18,989 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-10-20 00:47:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:47:18,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-10-20 00:47:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:18,991 INFO L225 Difference]: With dead ends: 96 [2020-10-20 00:47:18,991 INFO L226 Difference]: Without dead ends: 81 [2020-10-20 00:47:18,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-10-20 00:47:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-20 00:47:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2020-10-20 00:47:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 00:47:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2020-10-20 00:47:18,996 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 37 [2020-10-20 00:47:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:18,996 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2020-10-20 00:47:18,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 00:47:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2020-10-20 00:47:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 00:47:18,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:18,997 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:19,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-20 00:47:19,209 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1306822559, now seen corresponding path program 2 times [2020-10-20 00:47:19,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:19,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784508133] [2020-10-20 00:47:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:19,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784508133] [2020-10-20 00:47:19,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557212874] [2020-10-20 00:47:19,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:19,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:47:19,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:47:19,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-20 00:47:19,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:19,472 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:19,472 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,485 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,485 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 00:47:19,514 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,515 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:47:19,515 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,527 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:19,528 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,536 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,537 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-10-20 00:47:19,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:47:19,545 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 00:47:19,545 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-10-20 00:47:19,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 00:47:19,558 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,565 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,565 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-10-20 00:47:19,618 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:19,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-20 00:47:19,620 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,639 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:19,640 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2020-10-20 00:47:19,739 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,739 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2020-10-20 00:47:19,740 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,783 INFO L625 ElimStorePlain]: treesize reduction 32, result has 58.4 percent of original size [2020-10-20 00:47:19,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:19,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:45 [2020-10-20 00:47:19,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:19,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 1] term [2020-10-20 00:47:19,938 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 00:47:19,992 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-20 00:47:19,993 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:19,999 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:19,999 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-10-20 00:47:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:20,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:20,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2020-10-20 00:47:20,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820990372] [2020-10-20 00:47:20,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-20 00:47:20,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 00:47:20,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-10-20 00:47:20,008 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand 17 states. [2020-10-20 00:47:24,898 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-10-20 00:47:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:25,066 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-10-20 00:47:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 00:47:25,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2020-10-20 00:47:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:25,068 INFO L225 Difference]: With dead ends: 96 [2020-10-20 00:47:25,068 INFO L226 Difference]: Without dead ends: 90 [2020-10-20 00:47:25,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=574, Unknown=1, NotChecked=0, Total=702 [2020-10-20 00:47:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-20 00:47:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2020-10-20 00:47:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 00:47:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-10-20 00:47:25,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 37 [2020-10-20 00:47:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:25,074 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-10-20 00:47:25,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-20 00:47:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-10-20 00:47:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 00:47:25,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:25,075 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:25,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:25,283 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1056055519, now seen corresponding path program 1 times [2020-10-20 00:47:25,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:25,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597234848] [2020-10-20 00:47:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:25,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597234848] [2020-10-20 00:47:25,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208492706] [2020-10-20 00:47:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:25,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-20 00:47:25,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:25,575 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:25,575 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,577 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,578 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 00:47:25,621 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,622 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-20 00:47:25,623 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,652 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-10-20 00:47:25,657 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:25,658 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,668 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,668 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-10-20 00:47:25,707 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:25,707 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 00:47:25,708 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-10-20 00:47:25,761 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,762 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-20 00:47:25,762 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,776 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 00:47:25,777 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,784 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,784 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-10-20 00:47:25,836 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:25,837 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-20 00:47:25,838 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,847 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:25,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-10-20 00:47:25,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-20 00:47:25,917 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:25,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:25,931 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:25,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-20 00:47:26,007 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-20 00:47:26,009 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:26,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:26,018 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:26,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-20 00:47:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:26,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:26,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-10-20 00:47:26,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083284913] [2020-10-20 00:47:26,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 00:47:26,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 00:47:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:47:26,044 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 20 states. [2020-10-20 00:47:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:27,017 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2020-10-20 00:47:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 00:47:27,017 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2020-10-20 00:47:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:27,018 INFO L225 Difference]: With dead ends: 120 [2020-10-20 00:47:27,018 INFO L226 Difference]: Without dead ends: 112 [2020-10-20 00:47:27,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2020-10-20 00:47:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-20 00:47:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2020-10-20 00:47:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-20 00:47:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2020-10-20 00:47:27,031 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 37 [2020-10-20 00:47:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:27,033 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2020-10-20 00:47:27,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 00:47:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2020-10-20 00:47:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 00:47:27,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:27,034 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:27,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:27,242 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2099505628, now seen corresponding path program 1 times [2020-10-20 00:47:27,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:27,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711355145] [2020-10-20 00:47:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:27,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711355145] [2020-10-20 00:47:27,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478700381] [2020-10-20 00:47:27,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 00:47:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:27,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-20 00:47:27,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:27,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 00:47:27,538 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,540 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 00:47:27,626 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,626 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-20 00:47:27,627 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,660 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-10-20 00:47:27,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:27,664 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,679 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-10-20 00:47:27,720 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:27,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 00:47:27,721 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,731 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,731 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,732 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-10-20 00:47:27,770 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,770 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-20 00:47:27,771 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,785 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 00:47:27,786 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,797 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,797 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-10-20 00:47:27,836 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 00:47:27,836 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-20 00:47:27,837 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:27,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-10-20 00:47:27,892 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-20 00:47:27,893 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:27,907 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:27,907 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-20 00:47:27,990 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-20 00:47:27,991 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:27,998 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:28,000 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:28,000 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-20 00:47:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:28,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:28,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-10-20 00:47:28,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241493627] [2020-10-20 00:47:28,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 00:47:28,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:28,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 00:47:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:47:28,036 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand 20 states. [2020-10-20 00:47:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:30,915 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2020-10-20 00:47:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 00:47:30,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2020-10-20 00:47:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:30,919 INFO L225 Difference]: With dead ends: 130 [2020-10-20 00:47:30,919 INFO L226 Difference]: Without dead ends: 120 [2020-10-20 00:47:30,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2020-10-20 00:47:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-20 00:47:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2020-10-20 00:47:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 00:47:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2020-10-20 00:47:30,927 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 39 [2020-10-20 00:47:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:30,927 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2020-10-20 00:47:30,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 00:47:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2020-10-20 00:47:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 00:47:30,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:30,930 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:31,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-20 00:47:31,143 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:31,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412516, now seen corresponding path program 3 times [2020-10-20 00:47:31,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:31,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435757759] [2020-10-20 00:47:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:31,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435757759] [2020-10-20 00:47:31,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627653987] [2020-10-20 00:47:31,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:31,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 00:47:31,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:47:31,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 61 conjunts are in the unsatisfiable core [2020-10-20 00:47:31,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:31,561 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-10-20 00:47:31,562 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,566 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2020-10-20 00:47:31,588 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,589 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-20 00:47:31,589 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,612 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-10-20 00:47:31,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-10-20 00:47:31,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:31,648 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,665 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:31,665 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,680 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-10-20 00:47:31,735 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,735 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-10-20 00:47:31,736 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,757 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.base_54|, |v_#memory_$Pointer$.offset_47|]} [2020-10-20 00:47:31,761 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 00:47:31,762 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,806 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-10-20 00:47:31,807 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2020-10-20 00:47:31,808 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,841 INFO L625 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2020-10-20 00:47:31,846 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-20 00:47:31,846 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,861 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,861 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2020-10-20 00:47:31,915 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:31,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 149 [2020-10-20 00:47:31,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-10-20 00:47:31,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-10-20 00:47:31,919 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,971 INFO L625 ElimStorePlain]: treesize reduction 26, result has 85.6 percent of original size [2020-10-20 00:47:31,975 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 105 [2020-10-20 00:47:31,976 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:31,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:47:32,008 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2020-10-20 00:47:32,008 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,025 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,026 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2020-10-20 00:47:32,078 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|], 6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_56|]} [2020-10-20 00:47:32,083 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2020-10-20 00:47:32,083 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,159 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,159 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 257 [2020-10-20 00:47:32,161 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,203 INFO L625 ElimStorePlain]: treesize reduction 100, result has 61.8 percent of original size [2020-10-20 00:47:32,229 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,230 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 145 [2020-10-20 00:47:32,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-10-20 00:47:32,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 00:47:32,233 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,269 INFO L625 ElimStorePlain]: treesize reduction 108, result has 49.3 percent of original size [2020-10-20 00:47:32,269 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,270 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2020-10-20 00:47:32,375 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,375 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 68 [2020-10-20 00:47:32,377 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 00:47:32,378 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 00:47:32,379 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:32,414 INFO L625 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2020-10-20 00:47:32,417 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2020-10-20 00:47:32,418 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:32,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:32,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:47:32,428 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2020-10-20 00:47:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:47:32,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:32,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-10-20 00:47:32,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429912793] [2020-10-20 00:47:32,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 00:47:32,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:47:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 00:47:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:47:32,553 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 20 states. [2020-10-20 00:47:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:33,341 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2020-10-20 00:47:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 00:47:33,342 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2020-10-20 00:47:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:33,343 INFO L225 Difference]: With dead ends: 135 [2020-10-20 00:47:33,343 INFO L226 Difference]: Without dead ends: 127 [2020-10-20 00:47:33,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2020-10-20 00:47:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-20 00:47:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-10-20 00:47:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-20 00:47:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2020-10-20 00:47:33,350 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 39 [2020-10-20 00:47:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:33,350 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2020-10-20 00:47:33,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 00:47:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2020-10-20 00:47:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 00:47:33,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:33,351 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:33,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-20 00:47:33,564 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:33,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1726504804, now seen corresponding path program 1 times [2020-10-20 00:47:33,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:47:33,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976164099] [2020-10-20 00:47:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:47:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:47:33,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:47:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:47:33,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:47:33,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 00:47:33,665 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:47:33,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 00:47:33,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:47:33 BoogieIcfgContainer [2020-10-20 00:47:33,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:47:33,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:47:33,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:47:33,741 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:47:33,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:47:12" (3/4) ... [2020-10-20 00:47:33,744 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 00:47:33,803 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 00:47:33,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:47:33,805 INFO L168 Benchmark]: Toolchain (without parser) took 23050.56 ms. Allocated memory was 43.0 MB in the beginning and 106.4 MB in the end (delta: 63.4 MB). Free memory was 22.3 MB in the beginning and 61.9 MB in the end (delta: -39.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,805 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 48.6 kB). Peak memory consumption was 48.6 kB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.66 ms. Allocated memory was 43.0 MB in the beginning and 44.0 MB in the end (delta: 1.0 MB). Free memory was 21.4 MB in the beginning and 26.9 MB in the end (delta: -5.6 MB). Peak memory consumption was 11.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.22 ms. Allocated memory is still 44.0 MB. Free memory was 26.7 MB in the beginning and 24.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,806 INFO L168 Benchmark]: Boogie Preprocessor took 42.23 ms. Allocated memory is still 44.0 MB. Free memory was 24.2 MB in the beginning and 21.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,807 INFO L168 Benchmark]: RCFGBuilder took 638.73 ms. Allocated memory was 44.0 MB in the beginning and 48.2 MB in the end (delta: 4.2 MB). Free memory was 21.7 MB in the beginning and 27.5 MB in the end (delta: -5.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,807 INFO L168 Benchmark]: TraceAbstraction took 21722.33 ms. Allocated memory was 48.2 MB in the beginning and 106.4 MB in the end (delta: 58.2 MB). Free memory was 27.2 MB in the beginning and 66.7 MB in the end (delta: -39.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,808 INFO L168 Benchmark]: Witness Printer took 63.11 ms. Allocated memory is still 106.4 MB. Free memory was 66.7 MB in the beginning and 61.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:33,810 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.31 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 48.6 kB). Peak memory consumption was 48.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 513.66 ms. Allocated memory was 43.0 MB in the beginning and 44.0 MB in the end (delta: 1.0 MB). Free memory was 21.4 MB in the beginning and 26.9 MB in the end (delta: -5.6 MB). Peak memory consumption was 11.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 60.22 ms. Allocated memory is still 44.0 MB. Free memory was 26.7 MB in the beginning and 24.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 42.23 ms. Allocated memory is still 44.0 MB. Free memory was 24.2 MB in the beginning and 21.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 638.73 ms. Allocated memory was 44.0 MB in the beginning and 48.2 MB in the end (delta: 4.2 MB). Free memory was 21.7 MB in the beginning and 27.5 MB in the end (delta: -5.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. * TraceAbstraction took 21722.33 ms. Allocated memory was 48.2 MB in the beginning and 106.4 MB in the end (delta: 58.2 MB). Free memory was 27.2 MB in the beginning and 66.7 MB in the end (delta: -39.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 14.3 GB. * Witness Printer took 63.11 ms. Allocated memory is still 106.4 MB. Free memory was 66.7 MB in the beginning and 61.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) [L597] List t; [L598] List p = a; [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list_and_tree_cnstr-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.5s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 870 SDtfs, 836 SDslu, 4454 SDs, 0 SdLazy, 2661 SolverSat, 316 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 303 SyntacticMatches, 6 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 193 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 791 ConstructedInterpolants, 26 QuantifiedInterpolants, 223107 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 332 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 42/134 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 incorrect! Received shutdown request...