java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 00:28:22,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:28:22,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:28:22,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:28:22,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:28:22,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:28:22,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:28:22,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:28:22,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:28:22,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:28:22,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:28:22,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:28:22,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:28:22,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:28:22,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:28:22,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:28:22,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:28:22,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:28:22,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:28:22,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:28:22,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:28:22,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:28:22,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:28:22,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:28:22,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:28:22,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:28:22,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:28:22,328 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:28:22,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:28:22,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:28:22,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:28:22,329 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:28:22,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:28:22,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:28:22,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:28:22,334 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:28:22,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:28:22,334 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:28:22,334 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:28:22,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:28:22,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 00:28:22,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:28:22,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:28:22,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:28:22,337 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:28:22,338 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:28:22,338 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:28:22,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:28:22,369 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:28:22,372 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:28:22,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:28:22,373 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:28:22,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-01-30 00:28:22,445 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:28:22,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:28:22,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:28:22,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:28:22,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:28:22,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f99245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22, skipping insertion in model container [2018-01-30 00:28:22,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,465 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:28:22,476 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:28:22,563 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:28:22,574 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:28:22,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22 WrapperNode [2018-01-30 00:28:22,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:28:22,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:28:22,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:28:22,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:28:22,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... [2018-01-30 00:28:22,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:28:22,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:28:22,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:28:22,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:28:22,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (1/1) ... No working directory specified, using /home/daniel/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 [2018-01-30 00:28:22,633 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:28:22,633 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:28:22,633 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 00:28:22,633 INFO L136 BoogieDeclarations]: Found implementation of procedure init [2018-01-30 00:28:22,633 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:28:22,633 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:28:22,633 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:28:22,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:28:22,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:28:22,633 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:28:22,633 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:28:22,634 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:28:22,634 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 00:28:22,634 INFO L128 BoogieDeclarations]: Found specification of procedure init [2018-01-30 00:28:22,634 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:28:22,634 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:28:22,634 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:28:22,913 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:28:22,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:28:22 BoogieIcfgContainer [2018-01-30 00:28:22,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:28:22,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:28:22,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:28:22,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:28:22,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:28:22" (1/3) ... [2018-01-30 00:28:22,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b78ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:28:22, skipping insertion in model container [2018-01-30 00:28:22,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:28:22" (2/3) ... [2018-01-30 00:28:22,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b78ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:28:22, skipping insertion in model container [2018-01-30 00:28:22,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:28:22" (3/3) ... [2018-01-30 00:28:22,918 INFO L107 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2018-01-30 00:28:22,922 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:28:22,927 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 00:28:22,950 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:28:22,951 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:28:22,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:28:22,951 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:28:22,951 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:28:22,951 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:28:22,951 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:28:22,951 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:28:22,951 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:28:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-30 00:28:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:28:22,964 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:22,965 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:22,965 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash 498648678, now seen corresponding path program 1 times [2018-01-30 00:28:22,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:22,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:23,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:23,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:28:23,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:23,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:28:23,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:28:23,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:28:23,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:28:23,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:28:23,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:28:23,065 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-01-30 00:28:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:23,079 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-01-30 00:28:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:28:23,080 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-30 00:28:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:23,085 INFO L225 Difference]: With dead ends: 94 [2018-01-30 00:28:23,085 INFO L226 Difference]: Without dead ends: 51 [2018-01-30 00:28:23,087 INFO L553 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 [2018-01-30 00:28:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-30 00:28:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-30 00:28:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-30 00:28:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-30 00:28:23,118 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 29 [2018-01-30 00:28:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:23,118 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-30 00:28:23,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:28:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-30 00:28:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:28:23,119 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:23,119 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:23,119 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash -661927114, now seen corresponding path program 1 times [2018-01-30 00:28:23,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:23,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:23,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:23,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:28:23,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:23,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:28:23,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:28:23,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:28:23,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:28:23,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:28:23,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:28:23,198 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 3 states. [2018-01-30 00:28:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:23,386 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-01-30 00:28:23,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:28:23,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-30 00:28:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:23,388 INFO L225 Difference]: With dead ends: 84 [2018-01-30 00:28:23,389 INFO L226 Difference]: Without dead ends: 68 [2018-01-30 00:28:23,389 INFO L553 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 [2018-01-30 00:28:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-30 00:28:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2018-01-30 00:28:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-30 00:28:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-30 00:28:23,397 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 31 [2018-01-30 00:28:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:23,397 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-30 00:28:23,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:28:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-30 00:28:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:28:23,398 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:23,398 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:23,398 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1194282471, now seen corresponding path program 1 times [2018-01-30 00:28:23,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:23,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:23,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:23,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:28:23,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:23,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:28:23,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:28:23,485 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 00:28:23,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:28:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:23,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:28:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:28:23,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:28:23,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-01-30 00:28:23,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:28:23,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:28:23,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:28:23,722 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 8 states. [2018-01-30 00:28:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:24,015 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2018-01-30 00:28:24,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:28:24,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-30 00:28:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:24,017 INFO L225 Difference]: With dead ends: 115 [2018-01-30 00:28:24,017 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:28:24,017 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:28:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:28:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2018-01-30 00:28:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 00:28:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-30 00:28:24,021 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 39 [2018-01-30 00:28:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:24,021 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-30 00:28:24,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:28:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-30 00:28:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:28:24,022 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:24,022 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:24,022 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1067678431, now seen corresponding path program 1 times [2018-01-30 00:28:24,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:24,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:24,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:24,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:28:24,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:24,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:28:24,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:28:24,139 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 00:28:24,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:28:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:24,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:28:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:28:24,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:28:24,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-01-30 00:28:24,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:28:24,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:28:24,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:28:24,418 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-01-30 00:28:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:24,535 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-01-30 00:28:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:28:24,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-01-30 00:28:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:24,537 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:28:24,537 INFO L226 Difference]: Without dead ends: 76 [2018-01-30 00:28:24,537 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:28:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-30 00:28:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-01-30 00:28:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-30 00:28:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-30 00:28:24,541 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 54 [2018-01-30 00:28:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:24,541 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-30 00:28:24,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:28:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-30 00:28:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:28:24,542 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:24,542 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:24,542 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash -754540104, now seen corresponding path program 2 times [2018-01-30 00:28:24,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:24,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:24,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:24,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:28:24,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:24,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:28:24,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:28:24,683 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:28:24,688 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:28:24,698 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:28:24,707 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:28:24,708 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:28:24,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:28:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 00:28:24,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:28:24,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-01-30 00:28:24,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 00:28:24,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 00:28:24,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:28:24,792 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 14 states. [2018-01-30 00:28:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:25,319 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2018-01-30 00:28:25,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:28:25,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-01-30 00:28:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:25,320 INFO L225 Difference]: With dead ends: 149 [2018-01-30 00:28:25,320 INFO L226 Difference]: Without dead ends: 108 [2018-01-30 00:28:25,321 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:28:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-30 00:28:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-30 00:28:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 00:28:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-30 00:28:25,326 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 61 [2018-01-30 00:28:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:25,326 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-30 00:28:25,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 00:28:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-30 00:28:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 00:28:25,327 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:25,327 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:25,328 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1560653424, now seen corresponding path program 3 times [2018-01-30 00:28:25,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:25,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:25,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:25,329 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:28:25,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:25,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-30 00:28:25,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:28:25,452 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:28:25,459 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:28:25,469 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:28:25,476 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:28:25,477 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:28:25,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:28:25,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:28:25,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-01-30 00:28:25,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:28:25,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:28:25,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:28:25,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-30 00:28:25,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 00:28:25,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-01-30 00:28:25,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:28:25,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:28:25,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:28:25,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2018-01-30 00:28:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-30 00:28:26,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:28:26,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2018-01-30 00:28:26,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:28:26,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:28:26,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:28:26,001 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 23 states. [2018-01-30 00:28:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:26,704 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-01-30 00:28:26,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:28:26,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2018-01-30 00:28:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:26,705 INFO L225 Difference]: With dead ends: 135 [2018-01-30 00:28:26,705 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 00:28:26,705 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=371, Invalid=1609, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 00:28:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 00:28:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2018-01-30 00:28:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:28:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-01-30 00:28:26,710 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 76 [2018-01-30 00:28:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:26,710 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-01-30 00:28:26,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:28:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-01-30 00:28:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 00:28:26,711 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:28:26,711 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:28:26,711 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 00:28:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1073802353, now seen corresponding path program 1 times [2018-01-30 00:28:26,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:28:26,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:28:26,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:26,712 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:28:26,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:28:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:28:26,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:28:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-01-30 00:28:26,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:28:26,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:28:26,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:28:26,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:28:26,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:28:26,755 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 3 states. [2018-01-30 00:28:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:28:26,764 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-30 00:28:26,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:28:26,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-01-30 00:28:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:28:26,765 INFO L225 Difference]: With dead ends: 153 [2018-01-30 00:28:26,765 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:28:26,766 INFO L553 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 [2018-01-30 00:28:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:28:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:28:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:28:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:28:26,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-01-30 00:28:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:28:26,766 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:28:26,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:28:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:28:26,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:28:26,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:28:26,971 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 37 DAG size of output 26 [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L12'''(line 12) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L12''''(line 12) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L402 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L14''(line 14) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L12''''''(lines 12 15) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L9(lines 9 16) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-30 00:28:27,053 INFO L395 ceAbstractionStarter]: At program point L12'''''(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and .cse0 (= 0 init_~i~5) .cse1 .cse2) (and (exists ((v_prenex_1 Int)) (and (<= init_~i~5 (+ v_prenex_1 1)) (< v_prenex_1 init_~size) (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_prenex_1) |init_#in~a.offset|)) 0)))) .cse0 .cse1 .cse2))) [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L12'(lines 12 15) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L14'(line 14) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 37) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: true [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L34''(line 34) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L402 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L24(lines 24 30) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L19'(line 19) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-30 00:28:27,054 INFO L399 ceAbstractionStarter]: For program point L19''(line 19) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L24''(lines 24 30) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L402 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L395 ceAbstractionStarter]: At program point L34'(line 34) the Hoare annotation is: false [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L31'''(line 31) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L31''''''(lines 31 35) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L31''(lines 31 35) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L31''''(line 31) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-30 00:28:27,055 INFO L395 ceAbstractionStarter]: At program point L24'''''(lines 24 30) the Hoare annotation is: (let ((.cse0 (exists ((v_prenex_1 Int)) (and (<= 99999 v_prenex_1) (< v_prenex_1 100000) (not (= (select (select |#memory_$Pointer$.base| |main_~#a~7.base|) (+ (* 4 v_prenex_1) |main_~#a~7.offset|)) 0)))))) (or (and (= main_~flag~7 1) .cse0) (and .cse0 (< main_~i~7 100000)))) [2018-01-30 00:28:27,055 INFO L399 ceAbstractionStarter]: For program point L26''''(line 26) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L395 ceAbstractionStarter]: At program point L31'''''(lines 31 35) the Hoare annotation is: (and (= main_~flag~7 1) (exists ((v_prenex_1 Int)) (and (<= 99999 v_prenex_1) (< v_prenex_1 100000) (not (= (select (select |#memory_$Pointer$.base| |main_~#a~7.base|) (+ (* 4 v_prenex_1) |main_~#a~7.offset|)) 0))))) [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point L24''''''(lines 24 30) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L402 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point L4'''(line 4) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point L4'(line 4) no Hoare annotation was computed. [2018-01-30 00:28:27,056 INFO L399 ceAbstractionStarter]: For program point __VERIFIER_assertErr0AssertViolation(line 4) no Hoare annotation was computed. [2018-01-30 00:28:27,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,059 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,060 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,061 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,061 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,062 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,063 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,063 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,066 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,067 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,067 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,067 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:28:27 BoogieIcfgContainer [2018-01-30 00:28:27,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:28:27,069 INFO L168 Benchmark]: Toolchain (without parser) took 4623.35 ms. Allocated memory was 148.9 MB in the beginning and 254.8 MB in the end (delta: 105.9 MB). Free memory was 113.8 MB in the beginning and 167.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 52.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:28:27,069 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:28:27,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.43 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 105.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:28:27,070 INFO L168 Benchmark]: Boogie Preprocessor took 20.14 ms. Allocated memory is still 148.9 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:28:27,070 INFO L168 Benchmark]: RCFGBuilder took 315.18 ms. Allocated memory is still 148.9 MB. Free memory was 103.6 MB in the beginning and 86.5 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:28:27,070 INFO L168 Benchmark]: TraceAbstraction took 4154.44 ms. Allocated memory was 148.9 MB in the beginning and 254.8 MB in the end (delta: 105.9 MB). Free memory was 86.5 MB in the beginning and 167.8 MB in the end (delta: -81.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:28:27,071 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 130.43 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 105.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.14 ms. Allocated memory is still 148.9 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.18 ms. Allocated memory is still 148.9 MB. Free memory was 103.6 MB in the beginning and 86.5 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4154.44 ms. Allocated memory was 148.9 MB in the beginning and 254.8 MB in the end (delta: 105.9 MB). Free memory was 86.5 MB in the beginning and 167.8 MB in the end (delta: -81.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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_prenex_1,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$ * 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: 31]: Loop Invariant [2018-01-30 00:28:27,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,073 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,074 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: flag == 1 && (\exists v_prenex_1 : int :: (99999 <= v_prenex_1 && v_prenex_1 < 100000) && !(#memory_$Pointer$[a][4 * v_prenex_1 + a] == 0)) - InvariantResult [Line: 24]: Loop Invariant [2018-01-30 00:28:27,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,074 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,075 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,076 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,077 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,077 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (flag == 1 && (\exists v_prenex_1 : int :: (99999 <= v_prenex_1 && v_prenex_1 < 100000) && !(#memory_$Pointer$[a][4 * v_prenex_1 + a] == 0))) || ((\exists v_prenex_1 : int :: (99999 <= v_prenex_1 && v_prenex_1 < 100000) && !(#memory_$Pointer$[a][4 * v_prenex_1 + a] == 0)) && i < 100000) - InvariantResult [Line: 12]: Loop Invariant [2018-01-30 00:28:27,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,078 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-30 00:28:27,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,079 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-30 00:28:27,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-30 00:28:27,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((a == a && 0 == i) && \old(size) == size) && a == a) || ((((\exists v_prenex_1 : int :: (i <= v_prenex_1 + 1 && v_prenex_1 < size) && !(#memory_$Pointer$[a][4 * v_prenex_1 + a] == 0)) && a == a) && \old(size) == size) && a == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 58 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 354 SDtfs, 335 SDslu, 1466 SDs, 0 SdLazy, 605 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 31 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 209 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 613 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 602 ConstructedInterpolants, 26 QuantifiedInterpolants, 116347 SizeOfPredicates, 26 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 218/305 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_of_struct_ptr_flag_init_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-28-27-082.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_of_struct_ptr_flag_init_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-28-27-082.csv Received shutdown request...