./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/array-industry-pattern/array_of_struct_ptr_flag_init.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a39eefaccc62f602b71ff7e91e6bcef4799631 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:16:29,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:16:29,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:16:29,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:16:29,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:16:29,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:16:29,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:16:29,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:16:29,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:16:29,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:16:29,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:16:29,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:16:29,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:16:29,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:16:29,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:16:29,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:16:29,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:16:29,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:16:29,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:16:29,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:16:29,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:16:29,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:16:29,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:16:29,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:16:29,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:16:29,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:16:29,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:16:29,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:16:29,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:16:29,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:16:29,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:16:29,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:16:29,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:16:29,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:16:29,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:16:29,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:16:29,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:16:29,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:16:29,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:16:29,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:16:29,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:16:29,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:16:29,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:16:29,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:16:29,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:16:29,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:16:29,452 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:16:29,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:16:29,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:16:29,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:16:29,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:16:29,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:16:29,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:16:29,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:16:29,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:16:29,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:16:29,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:16:29,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:16:29,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:16:29,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:16:29,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:16:29,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:16:29,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:16:29,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:16:29,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:16:29,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:16:29,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:16:29,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:16:29,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:16:29,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:16:29,459 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(__VERIFIER_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 -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2019-11-27 22:16:29,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:16:29,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:16:29,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:16:29,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:16:29,810 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:16:29,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-11-27 22:16:29,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee974ece3/4b9d601d43e44c83892c589003f02512/FLAG383ffdd0a [2019-11-27 22:16:30,348 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:16:30,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-11-27 22:16:30,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee974ece3/4b9d601d43e44c83892c589003f02512/FLAG383ffdd0a [2019-11-27 22:16:30,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee974ece3/4b9d601d43e44c83892c589003f02512 [2019-11-27 22:16:30,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:16:30,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:16:30,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:16:30,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:16:30,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:16:30,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:16:30" (1/1) ... [2019-11-27 22:16:30,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9f85e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:30, skipping insertion in model container [2019-11-27 22:16:30,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:16:30" (1/1) ... [2019-11-27 22:16:30,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:16:30,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:16:30,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:16:30,965 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:16:30,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:16:31,003 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:16:31,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31 WrapperNode [2019-11-27 22:16:31,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:16:31,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:16:31,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:16:31,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:16:31,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:16:31,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:16:31,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:16:31,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:16:31,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (1/1) ... [2019-11-27 22:16:31,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:16:31,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:16:31,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:16:31,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:16:31,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (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 [2019-11-27 22:16:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 22:16:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 22:16:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:16:31,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:16:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:16:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 22:16:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:16:31,440 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:16:31,440 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 22:16:31,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:16:31 BoogieIcfgContainer [2019-11-27 22:16:31,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:16:31,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:16:31,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:16:31,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:16:31,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:16:30" (1/3) ... [2019-11-27 22:16:31,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5eff59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:16:31, skipping insertion in model container [2019-11-27 22:16:31,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:16:31" (2/3) ... [2019-11-27 22:16:31,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5eff59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:16:31, skipping insertion in model container [2019-11-27 22:16:31,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:16:31" (3/3) ... [2019-11-27 22:16:31,472 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-11-27 22:16:31,488 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:16:31,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:16:31,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:16:31,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:16:31,541 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:16:31,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:16:31,541 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:16:31,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:16:31,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:16:31,542 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:16:31,542 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:16:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-27 22:16:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 22:16:31,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:31,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:31,568 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-11-27 22:16:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755634] [2019-11-27 22:16:31,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:16:31,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755634] [2019-11-27 22:16:31,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:16:31,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:16:31,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902503232] [2019-11-27 22:16:31,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:16:31,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:16:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:16:31,730 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-27 22:16:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:31,745 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-11-27 22:16:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:16:31,746 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 22:16:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:31,757 INFO L225 Difference]: With dead ends: 36 [2019-11-27 22:16:31,758 INFO L226 Difference]: Without dead ends: 16 [2019-11-27 22:16:31,761 INFO L630 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 [2019-11-27 22:16:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-27 22:16:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-27 22:16:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 22:16:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-27 22:16:31,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-11-27 22:16:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:31,800 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-27 22:16:31,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:16:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-11-27 22:16:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 22:16:31,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:31,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:31,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:31,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-11-27 22:16:31,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:31,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128727015] [2019-11-27 22:16:31,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:16:31,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128727015] [2019-11-27 22:16:31,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:16:31,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:16:31,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465607659] [2019-11-27 22:16:31,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:16:31,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:16:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:16:31,861 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2019-11-27 22:16:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:31,900 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-27 22:16:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:16:31,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 22:16:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:31,902 INFO L225 Difference]: With dead ends: 34 [2019-11-27 22:16:31,903 INFO L226 Difference]: Without dead ends: 26 [2019-11-27 22:16:31,904 INFO L630 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 [2019-11-27 22:16:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-27 22:16:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-11-27 22:16:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 22:16:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-27 22:16:31,910 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-27 22:16:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:31,911 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-27 22:16:31,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:16:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-27 22:16:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:16:31,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:31,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:31,913 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2019-11-27 22:16:31,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:31,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246001534] [2019-11-27 22:16:31,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:16:31,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246001534] [2019-11-27 22:16:31,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:16:31,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:16:31,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264059359] [2019-11-27 22:16:31,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:16:31,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:31,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:16:31,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:16:31,979 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-11-27 22:16:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:32,009 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-11-27 22:16:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:16:32,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:16:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:32,010 INFO L225 Difference]: With dead ends: 31 [2019-11-27 22:16:32,010 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 22:16:32,011 INFO L630 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 [2019-11-27 22:16:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 22:16:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-27 22:16:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 22:16:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-27 22:16:32,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-11-27 22:16:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:32,016 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-27 22:16:32,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:16:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-27 22:16:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:16:32,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:32,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:32,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2019-11-27 22:16:32,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:32,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444215344] [2019-11-27 22:16:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:16:32,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444215344] [2019-11-27 22:16:32,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:16:32,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:16:32,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430053503] [2019-11-27 22:16:32,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:16:32,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:16:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:16:32,072 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-11-27 22:16:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:32,096 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-27 22:16:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:16:32,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:16:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:32,097 INFO L225 Difference]: With dead ends: 32 [2019-11-27 22:16:32,097 INFO L226 Difference]: Without dead ends: 19 [2019-11-27 22:16:32,098 INFO L630 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 [2019-11-27 22:16:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-27 22:16:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-27 22:16:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 22:16:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-27 22:16:32,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-11-27 22:16:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:32,103 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-27 22:16:32,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:16:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-27 22:16:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:16:32,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:32,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:32,104 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2019-11-27 22:16:32,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:32,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314458447] [2019-11-27 22:16:32,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:16:32,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314458447] [2019-11-27 22:16:32,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477488809] [2019-11-27 22:16:32,179 INFO L94 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 [2019-11-27 22:16:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:32,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 22:16:32,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:16:32,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:32,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-27 22:16:32,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157908782] [2019-11-27 22:16:32,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:16:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:16:32,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:16:32,310 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-11-27 22:16:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:32,335 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-27 22:16:32,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:16:32,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-27 22:16:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:32,337 INFO L225 Difference]: With dead ends: 34 [2019-11-27 22:16:32,337 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 22:16:32,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:16:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 22:16:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-27 22:16:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 22:16:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-27 22:16:32,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-11-27 22:16:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:32,344 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-27 22:16:32,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:16:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-27 22:16:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:16:32,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:32,346 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:32,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:32,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1949671069, now seen corresponding path program 2 times [2019-11-27 22:16:32,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:32,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664682298] [2019-11-27 22:16:32,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:16:32,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664682298] [2019-11-27 22:16:32,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319016571] [2019-11-27 22:16:32,669 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-27 22:16:32,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:16:32,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:32,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:16:32,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:16:32,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:32,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-27 22:16:32,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024935830] [2019-11-27 22:16:32,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:16:32,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:16:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:16:32,790 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-11-27 22:16:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:32,827 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-11-27 22:16:32,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:16:32,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-27 22:16:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:32,829 INFO L225 Difference]: With dead ends: 36 [2019-11-27 22:16:32,829 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 22:16:32,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:16:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 22:16:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-27 22:16:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 22:16:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-27 22:16:32,835 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-11-27 22:16:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:32,836 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-27 22:16:32,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:16:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-27 22:16:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:16:32,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:32,837 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:33,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:33,041 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash 381595099, now seen corresponding path program 3 times [2019-11-27 22:16:33,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:33,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922339831] [2019-11-27 22:16:33,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:16:33,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922339831] [2019-11-27 22:16:33,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134960699] [2019-11-27 22:16:33,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-27 22:16:33,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-27 22:16:33,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:33,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:16:33,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 22:16:33,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:33,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-27 22:16:33,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387339173] [2019-11-27 22:16:33,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:16:33,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:33,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:16:33,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:16:33,247 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-27 22:16:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:33,335 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-27 22:16:33,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:16:33,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-27 22:16:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:33,337 INFO L225 Difference]: With dead ends: 57 [2019-11-27 22:16:33,337 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 22:16:33,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:16:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 22:16:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-27 22:16:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 22:16:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-27 22:16:33,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-11-27 22:16:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:33,344 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-27 22:16:33,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:16:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-27 22:16:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:16:33,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:33,346 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:33,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:33,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 4 times [2019-11-27 22:16:33,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:33,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411097859] [2019-11-27 22:16:33,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 22:16:33,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411097859] [2019-11-27 22:16:33,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499876101] [2019-11-27 22:16:33,686 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2019-11-27 22:16:33,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 22:16:33,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:33,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:16:33,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:16:33,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:33,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-27 22:16:33,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065064208] [2019-11-27 22:16:33,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:16:33,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:33,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:16:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:16:33,806 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-11-27 22:16:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:33,912 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-11-27 22:16:33,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:16:33,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-27 22:16:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:33,914 INFO L225 Difference]: With dead ends: 72 [2019-11-27 22:16:33,914 INFO L226 Difference]: Without dead ends: 56 [2019-11-27 22:16:33,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:16:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-27 22:16:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-27 22:16:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 22:16:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-27 22:16:33,921 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2019-11-27 22:16:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:33,921 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-27 22:16:33,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:16:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-27 22:16:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:16:33,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:33,923 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:34,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:34,128 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:34,128 INFO L82 PathProgramCache]: Analyzing trace with hash -441689129, now seen corresponding path program 5 times [2019-11-27 22:16:34,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:34,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502656600] [2019-11-27 22:16:34,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 22:16:34,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502656600] [2019-11-27 22:16:34,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507054480] [2019-11-27 22:16:34,273 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_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 [2019-11-27 22:16:34,361 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-27 22:16:34,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:34,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 22:16:34,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:16:34,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:34,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-27 22:16:34,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646236362] [2019-11-27 22:16:34,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 22:16:34,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 22:16:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:16:34,430 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-11-27 22:16:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:34,596 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-27 22:16:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 22:16:34,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-27 22:16:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:34,598 INFO L225 Difference]: With dead ends: 87 [2019-11-27 22:16:34,598 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 22:16:34,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:16:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 22:16:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-11-27 22:16:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-27 22:16:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-27 22:16:34,612 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2019-11-27 22:16:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:34,615 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-27 22:16:34,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 22:16:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-27 22:16:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 22:16:34,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:34,617 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:34,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:34,818 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1895354217, now seen corresponding path program 6 times [2019-11-27 22:16:34,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:34,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419796914] [2019-11-27 22:16:34,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-27 22:16:34,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419796914] [2019-11-27 22:16:34,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799843385] [2019-11-27 22:16:34,964 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-11-27 22:16:35,018 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-27 22:16:35,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:35,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:16:35,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:16:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-27 22:16:35,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:35,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-27 22:16:35,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457685618] [2019-11-27 22:16:35,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 22:16:35,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 22:16:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:16:35,162 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-11-27 22:16:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:35,558 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-27 22:16:35,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 22:16:35,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-27 22:16:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:35,559 INFO L225 Difference]: With dead ends: 71 [2019-11-27 22:16:35,559 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 22:16:35,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-11-27 22:16:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 22:16:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-11-27 22:16:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:16:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-27 22:16:35,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-11-27 22:16:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:35,567 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-27 22:16:35,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 22:16:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-27 22:16:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-27 22:16:35,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:35,569 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:35,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:35,772 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:35,773 INFO L82 PathProgramCache]: Analyzing trace with hash -958805492, now seen corresponding path program 1 times [2019-11-27 22:16:35,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:35,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737599867] [2019-11-27 22:16:35,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-27 22:16:35,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737599867] [2019-11-27 22:16:35,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:16:35,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:16:35,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787970453] [2019-11-27 22:16:35,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:16:35,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:16:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:16:35,828 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-11-27 22:16:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:35,833 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-27 22:16:35,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:16:35,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-27 22:16:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:35,834 INFO L225 Difference]: With dead ends: 49 [2019-11-27 22:16:35,834 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 22:16:35,835 INFO L630 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 [2019-11-27 22:16:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 22:16:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-27 22:16:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:16:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-27 22:16:35,841 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-11-27 22:16:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:35,841 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-27 22:16:35,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:16:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-27 22:16:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:16:35,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:35,843 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:35,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:35,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1921874774, now seen corresponding path program 1 times [2019-11-27 22:16:35,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:35,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154287906] [2019-11-27 22:16:35,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:16:35,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154287906] [2019-11-27 22:16:35,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848225810] [2019-11-27 22:16:35,959 INFO L94 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 [2019-11-27 22:16:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:36,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 22:16:36,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:16:36,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:36,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 22:16:36,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699566950] [2019-11-27 22:16:36,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 22:16:36,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 22:16:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:16:36,191 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2019-11-27 22:16:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:36,236 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-27 22:16:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:16:36,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-27 22:16:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:36,237 INFO L225 Difference]: With dead ends: 70 [2019-11-27 22:16:36,238 INFO L226 Difference]: Without dead ends: 45 [2019-11-27 22:16:36,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:16:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-27 22:16:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-27 22:16:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-27 22:16:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-27 22:16:36,245 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-11-27 22:16:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:36,245 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-27 22:16:36,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 22:16:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-27 22:16:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:16:36,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:36,247 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:36,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:36,452 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash 575418516, now seen corresponding path program 2 times [2019-11-27 22:16:36,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:36,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655241679] [2019-11-27 22:16:36,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:16:36,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655241679] [2019-11-27 22:16:36,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451023470] [2019-11-27 22:16:36,591 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-27 22:16:36,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:16:36,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:36,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 22:16:36,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:16:36,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:36,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-27 22:16:36,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220763218] [2019-11-27 22:16:36,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-27 22:16:36,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:36,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-27 22:16:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-27 22:16:36,859 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-27 22:16:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:36,909 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-27 22:16:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:16:36,911 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-27 22:16:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:36,912 INFO L225 Difference]: With dead ends: 72 [2019-11-27 22:16:36,912 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 22:16:36,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-27 22:16:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 22:16:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-27 22:16:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-27 22:16:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-27 22:16:36,924 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-11-27 22:16:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:36,926 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-27 22:16:36,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-27 22:16:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-27 22:16:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 22:16:36,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:16:36,927 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:16:37,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:37,131 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:16:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:16:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash -583889326, now seen corresponding path program 3 times [2019-11-27 22:16:37,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:16:37,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503008757] [2019-11-27 22:16:37,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:16:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:16:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:16:37,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503008757] [2019-11-27 22:16:37,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712739089] [2019-11-27 22:16:37,304 INFO L92 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 [2019-11-27 22:16:37,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 22:16:37,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:16:37,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:16:37,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:16:37,491 INFO L377 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 15 treesize of output 11 [2019-11-27 22:16:37,491 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:16:37,502 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:16:37,503 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:16:37,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-27 22:16:37,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:16:37,669 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-11-27 22:16:37,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:16:37,672 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-27 22:16:37,685 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:16:37,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:16:37,690 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:16:37,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-11-27 22:16:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-27 22:16:37,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:16:37,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-27 22:16:37,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562787195] [2019-11-27 22:16:37,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 22:16:37,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:16:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 22:16:37,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-27 22:16:37,795 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2019-11-27 22:16:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:16:40,882 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-27 22:16:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-27 22:16:40,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-11-27 22:16:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:16:40,883 INFO L225 Difference]: With dead ends: 63 [2019-11-27 22:16:40,883 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:16:40,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-11-27 22:16:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:16:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:16:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:16:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:16:40,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-27 22:16:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:16:40,888 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:16:40,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 22:16:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:16:40,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:16:41,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:16:41,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:16:41,275 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-27 22:16:41,322 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-11-27 22:16:41,323 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (= ULTIMATE.start_main_~flag~0 1) [2019-11-27 22:16:41,323 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-11-27 22:16:41,323 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-11-27 22:16:41,323 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:16:41,323 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:16:41,323 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:16:41,323 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-11-27 22:16:41,323 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 100000) (<= 99999 v_ULTIMATE.start_init_~i~0_26)))) (.cse3 (= ULTIMATE.start_init_~size 100000)) (.cse4 (= ULTIMATE.start_main_~flag~0 0)) (.cse5 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse6 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)))))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 (<= ULTIMATE.start_main_~i~1 99999) .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse5 .cse6) (= ULTIMATE.start_main_~flag~0 1) (and .cse0 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (= ULTIMATE.start_init_~size 100000)) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_init_~i~0 0)))) [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-11-27 22:16:41,324 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:16:41,325 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-11-27 22:16:41,325 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-11-27 22:16:41,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:16:41,338 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,341 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,346 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,346 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,347 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,347 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,347 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,348 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,351 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:16:41,352 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,353 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,355 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,356 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:16:41 BoogieIcfgContainer [2019-11-27 22:16:41,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:16:41,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:16:41,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:16:41,372 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:16:41,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:16:31" (3/4) ... [2019-11-27 22:16:41,377 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:16:41,390 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-27 22:16:41,390 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:16:41,390 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 22:16:41,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && i == 0) [2019-11-27 22:16:41,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == #memory_$Pointer$[a][a] && a == 0) && i <= 99999) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || flag == 1) || (((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) [2019-11-27 22:16:41,437 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:16:41,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:16:41,439 INFO L168 Benchmark]: Toolchain (without parser) took 10693.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 268.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:16:41,440 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:16:41,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:16:41,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:16:41,443 INFO L168 Benchmark]: Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:16:41,444 INFO L168 Benchmark]: RCFGBuilder took 317.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:16:41,444 INFO L168 Benchmark]: TraceAbstraction took 9921.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.3 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:16:41,445 INFO L168 Benchmark]: Witness Printer took 66.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:16:41,448 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9921.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.3 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Witness Printer took 66.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-11-27 22:16:41,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:16:41,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,472 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:16:41,473 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,474 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,474 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((0 == #memory_$Pointer$[a][a] && a == 0) && i <= 99999) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || flag == 1) || (((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-11-27 22:16:41,481 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,483 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:16:41,483 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:16:41,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:16:41,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && i == 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 9.5s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 214 SDtfs, 241 SDslu, 499 SDs, 0 SdLazy, 507 SolverSat, 69 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 630 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 619 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 596 ConstructedInterpolants, 12 QuantifiedInterpolants, 79467 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 424/879 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...