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-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:43:26,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:43:26,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:43:26,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:43:26,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:43:26,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:43:26,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:43:26,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:43:26,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:43:26,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:43:26,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:43:26,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:43:26,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:43:26,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:43:26,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:43:26,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:43:26,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:43:26,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:43:26,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:43:26,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:43:26,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:43:26,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:43:26,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:43:26,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:43:26,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:43:26,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:43:26,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:43:26,364 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:43:26,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:43:26,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:43:26,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:43:26,366 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:43:26,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:43:26,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:43:26,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:43:26,375 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:43:26,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:43:26,376 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:43:26,376 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:43:26,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:43:26,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:43:26,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:43:26,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:43:26,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:43:26,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:43:26,378 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:43:26,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:43:26,378 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:43:26,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:43:26,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:43:26,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:43:26,379 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:43:26,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:43:26,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:43:26,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:43:26,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:43:26,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:43:26,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:43:26,380 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:43:26,381 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:43:26,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:43:26,423 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:43:26,426 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:43:26,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:43:26,428 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:43:26,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:43:26,580 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:43:26,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:43:26,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:43:26,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:43:26,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:43:26,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cffc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26, skipping insertion in model container [2018-01-29 22:43:26,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,616 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:43:26,659 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:43:26,782 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:43:26,802 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:43:26,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26 WrapperNode [2018-01-29 22:43:26,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:43:26,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:43:26,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:43:26,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:43:26,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... [2018-01-29 22:43:26,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:43:26,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:43:26,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:43:26,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:43:26,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (1/1) ... No working directory specified, using /storage/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-29 22:43:26,905 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:43:26,905 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:43:26,905 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-01-29 22:43:26,905 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-01-29 22:43:26,906 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:43:26,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:43:26,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:43:27,282 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:43:27,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:43:27 BoogieIcfgContainer [2018-01-29 22:43:27,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:43:27,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:43:27,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:43:27,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:43:27,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:43:26" (1/3) ... [2018-01-29 22:43:27,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1142c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:43:27, skipping insertion in model container [2018-01-29 22:43:27,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:26" (2/3) ... [2018-01-29 22:43:27,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1142c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:43:27, skipping insertion in model container [2018-01-29 22:43:27,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:43:27" (3/3) ... [2018-01-29 22:43:27,289 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:43:27,296 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:43:27,302 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-29 22:43:27,340 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:43:27,340 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:43:27,340 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:43:27,341 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:43:27,341 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:43:27,341 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:43:27,341 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:43:27,341 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:43:27,342 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:43:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-01-29 22:43:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:43:27,364 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:27,365 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:27,365 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:27,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1328855012, now seen corresponding path program 1 times [2018-01-29 22:43:27,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:27,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:27,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:27,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:27,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:27,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:27,548 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-29 22:43:27,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:27,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:43:27,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:43:27,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:43:27,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:43:27,566 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 4 states. [2018-01-29 22:43:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:27,801 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-01-29 22:43:27,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:43:27,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:43:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:27,811 INFO L225 Difference]: With dead ends: 122 [2018-01-29 22:43:27,812 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 22:43:27,814 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:43:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 22:43:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-29 22:43:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:43:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-29 22:43:27,851 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 19 [2018-01-29 22:43:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:27,851 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-29 22:43:27,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:43:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-29 22:43:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:43:27,852 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:27,852 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:27,852 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:27,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1328855011, now seen corresponding path program 1 times [2018-01-29 22:43:27,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:27,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:27,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:27,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:27,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:27,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:28,003 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-29 22:43:28,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:28,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:43:28,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:43:28,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:43:28,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:43:28,006 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 5 states. [2018-01-29 22:43:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:28,128 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-29 22:43:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:43:28,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 22:43:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:28,131 INFO L225 Difference]: With dead ends: 98 [2018-01-29 22:43:28,131 INFO L226 Difference]: Without dead ends: 97 [2018-01-29 22:43:28,132 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-29 22:43:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-29 22:43:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-29 22:43:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-29 22:43:28,142 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 19 [2018-01-29 22:43:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:28,142 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-29 22:43:28,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:43:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-29 22:43:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 22:43:28,143 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:28,143 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] [2018-01-29 22:43:28,143 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1205987434, now seen corresponding path program 1 times [2018-01-29 22:43:28,144 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:28,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:28,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:28,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:28,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:28,195 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-29 22:43:28,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:28,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:43:28,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:43:28,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:43:28,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:43:28,197 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 3 states. [2018-01-29 22:43:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:28,235 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-01-29 22:43:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:43:28,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-29 22:43:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:28,236 INFO L225 Difference]: With dead ends: 97 [2018-01-29 22:43:28,236 INFO L226 Difference]: Without dead ends: 91 [2018-01-29 22:43:28,236 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:43:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-29 22:43:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-29 22:43:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 22:43:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-29 22:43:28,244 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 22 [2018-01-29 22:43:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:28,244 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-29 22:43:28,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:43:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-29 22:43:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 22:43:28,245 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:28,245 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] [2018-01-29 22:43:28,245 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1205987433, now seen corresponding path program 1 times [2018-01-29 22:43:28,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:28,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:28,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:28,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:28,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:28,313 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-29 22:43:28,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:28,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:43:28,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:43:28,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:43:28,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:43:28,314 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 3 states. [2018-01-29 22:43:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:28,362 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-01-29 22:43:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:43:28,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-29 22:43:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:28,364 INFO L225 Difference]: With dead ends: 91 [2018-01-29 22:43:28,364 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:43:28,364 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:43:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:43:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:43:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:43:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-29 22:43:28,373 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 22 [2018-01-29 22:43:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:28,373 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-29 22:43:28,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:43:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-29 22:43:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:43:28,375 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:28,375 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:28,375 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1355476032, now seen corresponding path program 1 times [2018-01-29 22:43:28,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:28,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:28,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:28,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:28,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:28,565 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-29 22:43:28,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:28,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:43:28,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:43:28,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:43:28,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:43:28,567 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 9 states. [2018-01-29 22:43:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:28,747 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-29 22:43:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:43:28,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-29 22:43:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:28,748 INFO L225 Difference]: With dead ends: 89 [2018-01-29 22:43:28,748 INFO L226 Difference]: Without dead ends: 88 [2018-01-29 22:43:28,749 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:43:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-29 22:43:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-01-29 22:43:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:43:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-29 22:43:28,754 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-01-29 22:43:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:28,754 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-29 22:43:28,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:43:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-29 22:43:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:43:28,756 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:28,756 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:28,756 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1355476033, now seen corresponding path program 1 times [2018-01-29 22:43:28,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:28,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:28,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:28,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:28,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:29,018 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-29 22:43:29,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:29,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 22:43:29,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 22:43:29,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 22:43:29,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:43:29,020 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 11 states. [2018-01-29 22:43:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:29,329 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-01-29 22:43:29,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:43:29,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-29 22:43:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:29,370 INFO L225 Difference]: With dead ends: 99 [2018-01-29 22:43:29,370 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 22:43:29,370 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-01-29 22:43:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 22:43:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-01-29 22:43:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 22:43:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-29 22:43:29,379 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 38 [2018-01-29 22:43:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:29,381 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-29 22:43:29,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 22:43:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-29 22:43:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:43:29,382 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:29,382 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:29,383 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash -394292573, now seen corresponding path program 1 times [2018-01-29 22:43:29,383 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:29,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:29,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:29,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:29,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:29,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:29,485 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-29 22:43:29,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:29,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:43:29,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:43:29,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:43:29,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:43:29,487 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 7 states. [2018-01-29 22:43:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:29,546 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-01-29 22:43:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:43:29,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-29 22:43:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:29,547 INFO L225 Difference]: With dead ends: 121 [2018-01-29 22:43:29,547 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 22:43:29,548 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:43:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 22:43:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2018-01-29 22:43:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 22:43:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-01-29 22:43:29,554 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 39 [2018-01-29 22:43:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:29,555 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-01-29 22:43:29,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:43:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-01-29 22:43:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:43:29,556 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:29,556 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:29,556 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash -929915959, now seen corresponding path program 1 times [2018-01-29 22:43:29,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:29,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:29,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:29,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:29,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:29,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:29,697 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-29 22:43:29,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:29,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:43:29,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:43:29,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:43:29,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:43:29,698 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 10 states. [2018-01-29 22:43:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:29,862 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-01-29 22:43:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:43:29,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-29 22:43:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:29,864 INFO L225 Difference]: With dead ends: 109 [2018-01-29 22:43:29,864 INFO L226 Difference]: Without dead ends: 108 [2018-01-29 22:43:29,864 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:43:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-29 22:43:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-29 22:43:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-29 22:43:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-29 22:43:29,872 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 39 [2018-01-29 22:43:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:29,872 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-29 22:43:29,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:43:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-29 22:43:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:43:29,873 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:29,874 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:29,874 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash -929915958, now seen corresponding path program 1 times [2018-01-29 22:43:29,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:29,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:29,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:29,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:29,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:29,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:30,214 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-29 22:43:30,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:30,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-29 22:43:30,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 22:43:30,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 22:43:30,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:43:30,215 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 13 states. [2018-01-29 22:43:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:30,491 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-29 22:43:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 22:43:30,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-01-29 22:43:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:30,492 INFO L225 Difference]: With dead ends: 91 [2018-01-29 22:43:30,492 INFO L226 Difference]: Without dead ends: 90 [2018-01-29 22:43:30,493 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-01-29 22:43:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-29 22:43:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-29 22:43:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 22:43:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-01-29 22:43:30,499 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 39 [2018-01-29 22:43:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:30,500 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-01-29 22:43:30,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 22:43:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-01-29 22:43:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:43:30,501 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:30,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:30,502 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1813695983, now seen corresponding path program 1 times [2018-01-29 22:43:30,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:30,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:30,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:30,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:30,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:30,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:30,562 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-29 22:43:30,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:30,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:43:30,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:43:30,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:43:30,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:43:30,563 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2018-01-29 22:43:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:30,643 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-01-29 22:43:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:43:30,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-29 22:43:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:30,644 INFO L225 Difference]: With dead ends: 90 [2018-01-29 22:43:30,644 INFO L226 Difference]: Without dead ends: 89 [2018-01-29 22:43:30,645 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:43:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-29 22:43:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-29 22:43:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-29 22:43:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-29 22:43:30,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 52 [2018-01-29 22:43:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:30,652 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-29 22:43:30,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:43:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-29 22:43:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:43:30,652 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:30,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:30,653 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1813695982, now seen corresponding path program 1 times [2018-01-29 22:43:30,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:30,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:30,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:30,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:30,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:30,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:31,266 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-29 22:43:31,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:31,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-29 22:43:31,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 22:43:31,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 22:43:31,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-01-29 22:43:31,268 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 20 states. [2018-01-29 22:43:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:32,408 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-01-29 22:43:32,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:43:32,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-01-29 22:43:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:32,409 INFO L225 Difference]: With dead ends: 110 [2018-01-29 22:43:32,409 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:43:32,410 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 22:43:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:43:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-01-29 22:43:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-29 22:43:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-29 22:43:32,416 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 52 [2018-01-29 22:43:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:32,416 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-29 22:43:32,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 22:43:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-29 22:43:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 22:43:32,417 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:32,417 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:32,417 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 181229777, now seen corresponding path program 1 times [2018-01-29 22:43:32,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:32,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:32,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:32,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:32,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:32,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:32,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:32,806 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:32,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:32,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:32,939 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 14 treesize of output 11 [2018-01-29 22:43:32,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:32,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:32,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:32,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-29 22:43:33,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:33,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 17 [2018-01-29 22:43:33,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:33,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:33,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:33,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:33,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:33,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:33,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-01-29 22:43:33,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-01-29 22:43:33,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 22:43:33,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:33,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:33,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:33,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-01-29 22:43:33,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-01-29 22:43:33,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 22:43:33,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:33,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:33,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:33,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-01-29 22:43:33,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 22:43:33,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:33,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:33,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:33,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:43:33,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-29 22:43:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:33,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:33,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-01-29 22:43:33,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 22:43:33,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 22:43:33,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-01-29 22:43:33,823 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 27 states. [2018-01-29 22:43:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:35,108 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-29 22:43:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:43:35,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-01-29 22:43:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:35,112 INFO L225 Difference]: With dead ends: 131 [2018-01-29 22:43:35,113 INFO L226 Difference]: Without dead ends: 130 [2018-01-29 22:43:35,113 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=1367, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 22:43:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-29 22:43:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2018-01-29 22:43:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-29 22:43:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-01-29 22:43:35,122 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 53 [2018-01-29 22:43:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:35,122 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-01-29 22:43:35,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 22:43:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-01-29 22:43:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:43:35,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:35,123 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:35,124 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1323155770, now seen corresponding path program 1 times [2018-01-29 22:43:35,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:35,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:35,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:35,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:35,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:35,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:35,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:35,665 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:35,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:35,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:35,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:35,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:35,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:43:35,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:35,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:43:35,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:35,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:35,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:43:35,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-29 22:43:35,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:35,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:35,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:35,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:35,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:43:35,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-01-29 22:43:35,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:35,932 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 8 treesize of output 7 [2018-01-29 22:43:35,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:35,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:35,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:35,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-29 22:43:36,006 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 25 treesize of output 19 [2018-01-29 22:43:36,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-29 22:43:36,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:36,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:36,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 22:43:36,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:43:36,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:36,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:36,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:36,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-29 22:43:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:36,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:36,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-01-29 22:43:36,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 22:43:36,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 22:43:36,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 22:43:36,509 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 37 states. [2018-01-29 22:43:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:38,434 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-29 22:43:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 22:43:38,434 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-01-29 22:43:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:38,435 INFO L225 Difference]: With dead ends: 121 [2018-01-29 22:43:38,435 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 22:43:38,436 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=402, Invalid=3258, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 22:43:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 22:43:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-01-29 22:43:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:43:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-29 22:43:38,442 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 54 [2018-01-29 22:43:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:38,443 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-29 22:43:38,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 22:43:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-29 22:43:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:43:38,443 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:38,444 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, 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-29 22:43:38,444 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1763818456, now seen corresponding path program 1 times [2018-01-29 22:43:38,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:38,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:38,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:38,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:38,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:39,117 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-29 22:43:39,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:39,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-29 22:43:39,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 22:43:39,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 22:43:39,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-29 22:43:39,119 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 16 states. [2018-01-29 22:43:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:39,341 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-01-29 22:43:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:43:39,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-01-29 22:43:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:39,342 INFO L225 Difference]: With dead ends: 136 [2018-01-29 22:43:39,342 INFO L226 Difference]: Without dead ends: 108 [2018-01-29 22:43:39,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-01-29 22:43:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-29 22:43:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2018-01-29 22:43:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 22:43:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-01-29 22:43:39,349 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 61 [2018-01-29 22:43:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:39,349 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-01-29 22:43:39,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 22:43:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-01-29 22:43:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:43:39,349 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:39,350 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:39,350 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 97976226, now seen corresponding path program 1 times [2018-01-29 22:43:39,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:39,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:39,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:39,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:39,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:39,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:40,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:40,123 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-29 22:43:40,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:40,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:40,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:40,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:40,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:43:40,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:40,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:40,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:43:40,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:43:40,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-29 22:43:40,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:40,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:40,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:40,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:40,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:43:40,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-29 22:43:40,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:40,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:40,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:40,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:40,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-01-29 22:43:40,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-29 22:43:40,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-29 22:43:40,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 22:43:40,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:43:40,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:40,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-01-29 22:43:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:41,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:41,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2018-01-29 22:43:41,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-29 22:43:41,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-29 22:43:41,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1771, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 22:43:41,138 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 44 states. [2018-01-29 22:43:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:45,104 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-01-29 22:43:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-29 22:43:45,135 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 61 [2018-01-29 22:43:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:45,135 INFO L225 Difference]: With dead ends: 153 [2018-01-29 22:43:45,135 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 22:43:45,137 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=810, Invalid=8310, Unknown=0, NotChecked=0, Total=9120 [2018-01-29 22:43:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 22:43:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-29 22:43:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:43:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-29 22:43:45,145 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 61 [2018-01-29 22:43:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:45,145 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-29 22:43:45,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-29 22:43:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-29 22:43:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 22:43:45,146 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:45,146 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:45,146 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1096392030, now seen corresponding path program 1 times [2018-01-29 22:43:45,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:45,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:45,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:45,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:45,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:45,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:46,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:46,166 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-29 22:43:46,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:46,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:46,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:46,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:46,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:43:46,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:46,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:43:46,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:46,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:46,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:46,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:43:46,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:43:46,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:46,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:46,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:32 [2018-01-29 22:43:46,406 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 38 treesize of output 35 [2018-01-29 22:43:46,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:46,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,431 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 28 treesize of output 25 [2018-01-29 22:43:46,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:46,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,452 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 24 treesize of output 21 [2018-01-29 22:43:46,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:46,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,473 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 34 treesize of output 31 [2018-01-29 22:43:46,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:46,475 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,480 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:46,492 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2018-01-29 22:43:46,570 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 45 treesize of output 39 [2018-01-29 22:43:46,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-01-29 22:43:46,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,595 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 30 treesize of output 26 [2018-01-29 22:43:46,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:43:46,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,613 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 34 treesize of output 30 [2018-01-29 22:43:46,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:43:46,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,619 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,630 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 23 treesize of output 19 [2018-01-29 22:43:46,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:43:46,631 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,635 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 22:43:46,653 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:80, output treesize:29 [2018-01-29 22:43:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:47,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:47,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2018-01-29 22:43:47,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:43:47,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:43:47,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1385, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:43:47,411 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 39 states. [2018-01-29 22:43:48,020 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 66 DAG size of output 57 [2018-01-29 22:43:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:49,810 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-01-29 22:43:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 22:43:49,811 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 67 [2018-01-29 22:43:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:49,811 INFO L225 Difference]: With dead ends: 115 [2018-01-29 22:43:49,811 INFO L226 Difference]: Without dead ends: 114 [2018-01-29 22:43:49,813 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=314, Invalid=3592, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 22:43:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-29 22:43:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2018-01-29 22:43:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:43:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-01-29 22:43:49,820 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 67 [2018-01-29 22:43:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:49,820 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-01-29 22:43:49,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:43:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-01-29 22:43:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 22:43:49,821 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:49,822 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-01-29 22:43:49,822 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 942815809, now seen corresponding path program 2 times [2018-01-29 22:43:49,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:49,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:49,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:49,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:49,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:49,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:50,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:50,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:50,704 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:50,721 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:50,731 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:50,734 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:50,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:50,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:50,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:43:50,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:50,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:50,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:50,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:50,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:43:50,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:50,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:43:50,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:50,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:43:50,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:50,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-29 22:43:50,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:50,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:50,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:50,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:50,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-01-29 22:43:50,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:50,970 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 8 treesize of output 7 [2018-01-29 22:43:50,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:50,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-29 22:43:50,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 22:43:50,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:51,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-01-29 22:43:51,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-29 22:43:51,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-01-29 22:43:51,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:51,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-01-29 22:43:51,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-29 22:43:51,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 22:43:51,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:51,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 [2018-01-29 22:43:51,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-29 22:43:51,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:51,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:51,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:51,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:31 [2018-01-29 22:43:51,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 22:43:51,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-29 22:43:51,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:51,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:51,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:43:51,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:55 [2018-01-29 22:43:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:52,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:52,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-01-29 22:43:52,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 22:43:52,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 22:43:52,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1963, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 22:43:52,283 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 46 states. [2018-01-29 22:43:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:55,260 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-01-29 22:43:55,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 22:43:55,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2018-01-29 22:43:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:55,280 INFO L225 Difference]: With dead ends: 130 [2018-01-29 22:43:55,280 INFO L226 Difference]: Without dead ends: 129 [2018-01-29 22:43:55,281 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=396, Invalid=4716, Unknown=0, NotChecked=0, Total=5112 [2018-01-29 22:43:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-29 22:43:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-01-29 22:43:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 22:43:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-01-29 22:43:55,290 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 68 [2018-01-29 22:43:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:55,290 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-01-29 22:43:55,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 22:43:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-01-29 22:43:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:43:55,291 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:55,291 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-01-29 22:43:55,291 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:43:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -837481014, now seen corresponding path program 2 times [2018-01-29 22:43:55,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:55,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:55,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:55,293 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:55,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:55,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:56,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:56,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:56,022 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:56,038 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:56,050 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:56,058 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:56,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:56,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:56,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:56,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:43:56,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:43:56,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:43:56,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-29 22:43:56,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:56,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:43:56,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-01-29 22:43:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:56,267 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 8 treesize of output 7 [2018-01-29 22:43:56,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:43:56,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:43:56,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-29 22:43:56,358 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 25 treesize of output 19 [2018-01-29 22:43:56,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-29 22:43:56,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 22:43:56,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:43:56,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:56,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-29 22:43:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:57,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:57,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-29 22:43:57,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-29 22:43:57,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-29 22:43:57,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:43:57,768 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 42 states. [2018-01-29 22:44:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:00,162 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-01-29 22:44:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-29 22:44:00,162 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 69 [2018-01-29 22:44:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:00,163 INFO L225 Difference]: With dead ends: 133 [2018-01-29 22:44:00,163 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 22:44:00,165 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=558, Invalid=5142, Unknown=0, NotChecked=0, Total=5700 [2018-01-29 22:44:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 22:44:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2018-01-29 22:44:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-29 22:44:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-01-29 22:44:00,175 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 69 [2018-01-29 22:44:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:00,175 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-01-29 22:44:00,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-29 22:44:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-01-29 22:44:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 22:44:00,176 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:00,176 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:44:00,177 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:44:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash -714342382, now seen corresponding path program 2 times [2018-01-29 22:44:00,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:00,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:00,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:00,178 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:00,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:00,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:00,969 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 29 DAG size of output 27 [2018-01-29 22:44:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:01,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:01,488 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:44:01,493 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:44:01,515 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:01,536 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:01,554 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:01,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:01,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:01,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:01,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:01,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:01,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:01,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:44:01,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:01,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:01,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:44:01,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:01,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:44:01,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:01,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:01,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-29 22:44:02,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:02,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:02,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:02,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:44:02,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:44:02,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-01-29 22:44:02,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:02,251 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 8 treesize of output 7 [2018-01-29 22:44:02,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:02,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:02,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-29 22:44:02,324 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 25 treesize of output 19 [2018-01-29 22:44:02,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-29 22:44:02,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 22:44:02,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:44:02,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:02,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:02,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-29 22:44:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:02,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:02,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-01-29 22:44:02,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-29 22:44:02,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-29 22:44:02,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 22:44:02,905 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 48 states. [2018-01-29 22:44:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:07,106 INFO L93 Difference]: Finished difference Result 225 states and 234 transitions. [2018-01-29 22:44:07,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-01-29 22:44:07,107 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 82 [2018-01-29 22:44:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:07,109 INFO L225 Difference]: With dead ends: 225 [2018-01-29 22:44:07,109 INFO L226 Difference]: Without dead ends: 224 [2018-01-29 22:44:07,112 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3525 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1244, Invalid=11188, Unknown=0, NotChecked=0, Total=12432 [2018-01-29 22:44:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-29 22:44:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2018-01-29 22:44:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-29 22:44:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2018-01-29 22:44:07,127 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 82 [2018-01-29 22:44:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:07,127 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2018-01-29 22:44:07,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-29 22:44:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2018-01-29 22:44:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-29 22:44:07,128 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:07,128 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-01-29 22:44:07,128 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:44:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash -98546991, now seen corresponding path program 3 times [2018-01-29 22:44:07,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:07,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:07,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:07,129 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:07,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:07,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:44:07,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:07,911 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:44:07,918 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:44:07,938 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:07,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:07,956 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:07,970 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:07,972 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:07,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:07,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:07,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:07,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:07,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:44:07,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:07,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:08,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:08,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:08,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:44:08,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-29 22:44:08,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 22:44:08,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-29 22:44:08,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:08,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-29 22:44:08,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:08,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:08,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:08,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-01-29 22:44:08,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:08,094 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 8 treesize of output 7 [2018-01-29 22:44:08,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-29 22:44:08,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 22:44:08,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:32 [2018-01-29 22:44:08,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-29 22:44:08,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-01-29 22:44:08,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2018-01-29 22:44:08,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-29 22:44:08,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 22:44:08,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:08,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2018-01-29 22:44:08,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:44:08,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:08,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:08,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:25 [2018-01-29 22:44:08,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:44:08,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:08,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:08,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:08,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:25 [2018-01-29 22:44:08,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-29 22:44:08,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-29 22:44:08,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:08,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:08,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:44:08,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:50 [2018-01-29 22:44:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-29 22:44:08,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:08,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 44 [2018-01-29 22:44:08,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 22:44:08,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 22:44:08,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 22:44:08,758 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand 45 states. [2018-01-29 22:44:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:10,634 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-29 22:44:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 22:44:10,634 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 83 [2018-01-29 22:44:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:10,635 INFO L225 Difference]: With dead ends: 189 [2018-01-29 22:44:10,635 INFO L226 Difference]: Without dead ends: 188 [2018-01-29 22:44:10,636 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=716, Invalid=4984, Unknown=0, NotChecked=0, Total=5700 [2018-01-29 22:44:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-29 22:44:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2018-01-29 22:44:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-29 22:44:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 179 transitions. [2018-01-29 22:44:10,647 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 179 transitions. Word has length 83 [2018-01-29 22:44:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:10,647 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 179 transitions. [2018-01-29 22:44:10,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 22:44:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 179 transitions. [2018-01-29 22:44:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-29 22:44:10,648 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:10,648 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:44:10,648 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:44:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1788321954, now seen corresponding path program 1 times [2018-01-29 22:44:10,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:10,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:10,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:10,649 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:10,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:10,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:11,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:11,446 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:44:11,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:44:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:11,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:11,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:11,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:11,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:44:11,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:44:11,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:44:11,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-29 22:44:11,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:44:11,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:11,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:44:11,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-01-29 22:44:11,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:11,704 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 8 treesize of output 7 [2018-01-29 22:44:11,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:11,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:11,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-29 22:44:11,795 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 25 treesize of output 19 [2018-01-29 22:44:11,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-29 22:44:11,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 22:44:11,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:44:11,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:11,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:11,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-29 22:44:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:12,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:12,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 56 [2018-01-29 22:44:12,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-29 22:44:12,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-29 22:44:12,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3012, Unknown=0, NotChecked=0, Total=3192 [2018-01-29 22:44:12,603 INFO L87 Difference]: Start difference. First operand 171 states and 179 transitions. Second operand 57 states. [2018-01-29 22:44:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:15,668 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2018-01-29 22:44:15,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 22:44:15,669 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 85 [2018-01-29 22:44:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:15,669 INFO L225 Difference]: With dead ends: 209 [2018-01-29 22:44:15,669 INFO L226 Difference]: Without dead ends: 167 [2018-01-29 22:44:15,670 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=942, Invalid=11048, Unknown=0, NotChecked=0, Total=11990 [2018-01-29 22:44:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-29 22:44:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-01-29 22:44:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-29 22:44:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-01-29 22:44:15,681 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 85 [2018-01-29 22:44:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:15,682 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-01-29 22:44:15,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-29 22:44:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-01-29 22:44:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-29 22:44:15,682 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:15,682 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:44:15,682 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:44:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash 873984418, now seen corresponding path program 2 times [2018-01-29 22:44:15,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:15,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:15,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:15,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:44:15,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:15,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:16,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:16,712 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:44:16,717 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:44:16,736 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:16,779 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:16,784 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:16,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:16,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:16,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:16,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:44:16,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:16,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:44:16,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:16,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:16,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:44:16,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-01-29 22:44:16,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:16,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:16,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:16,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:44:16,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:44:16,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-01-29 22:44:16,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:16,991 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 8 treesize of output 7 [2018-01-29 22:44:16,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:16,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 22:44:17,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:17,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-29 22:44:17,075 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 25 treesize of output 19 [2018-01-29 22:44:17,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-01-29 22:44:17,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 22:44:17,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:44:17,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:17,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:17,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-29 22:44:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:17,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:17,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2018-01-29 22:44:17,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-29 22:44:17,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-29 22:44:17,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2701, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 22:44:17,866 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 54 states. [2018-01-29 22:44:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:20,720 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2018-01-29 22:44:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-29 22:44:20,721 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 91 [2018-01-29 22:44:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:20,721 INFO L225 Difference]: With dead ends: 188 [2018-01-29 22:44:20,722 INFO L226 Difference]: Without dead ends: 145 [2018-01-29 22:44:20,722 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=832, Invalid=9674, Unknown=0, NotChecked=0, Total=10506 [2018-01-29 22:44:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-29 22:44:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-01-29 22:44:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-29 22:44:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-01-29 22:44:20,731 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 91 [2018-01-29 22:44:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:20,731 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-01-29 22:44:20,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-29 22:44:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-01-29 22:44:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-29 22:44:20,731 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:20,732 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:44:20,732 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:44:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash -448521198, now seen corresponding path program 3 times [2018-01-29 22:44:20,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:20,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:20,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:20,733 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:20,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:20,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 134 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:22,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:22,382 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:44:22,387 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:44:22,408 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:22,439 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:22,474 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:22,524 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:22,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:22,797 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:23,304 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:23,318 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:23,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:23,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:23,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:23,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:44:23,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:23,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:23,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:23,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 [2018-01-29 22:44:23,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:44:23,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2018-01-29 22:44:23,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:23,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:23,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:38 [2018-01-29 22:44:23,447 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 41 treesize of output 38 [2018-01-29 22:44:23,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:23,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,476 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 31 treesize of output 28 [2018-01-29 22:44:23,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:23,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,499 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 27 treesize of output 24 [2018-01-29 22:44:23,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:23,501 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,520 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 37 treesize of output 34 [2018-01-29 22:44:23,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:23,522 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:23,542 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:73, output treesize:58 [2018-01-29 22:44:23,635 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 37 treesize of output 33 [2018-01-29 22:44:23,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:44:23,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,658 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 26 treesize of output 22 [2018-01-29 22:44:23,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:44:23,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,686 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 48 treesize of output 44 [2018-01-29 22:44:23,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 22:44:23,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,708 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 37 treesize of output 31 [2018-01-29 22:44:23,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-01-29 22:44:23,710 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,715 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:23,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 22:44:23,726 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:86, output treesize:35 [2018-01-29 22:44:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:25,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:25,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 70 [2018-01-29 22:44:25,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-01-29 22:44:25,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-01-29 22:44:25,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4650, Unknown=0, NotChecked=0, Total=4970 [2018-01-29 22:44:25,521 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 71 states. [2018-01-29 22:44:26,269 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 75 DAG size of output 57 [2018-01-29 22:44:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:31,908 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-01-29 22:44:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-29 22:44:31,909 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2018-01-29 22:44:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:31,909 INFO L225 Difference]: With dead ends: 177 [2018-01-29 22:44:31,909 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:44:31,911 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1133, Invalid=14869, Unknown=0, NotChecked=0, Total=16002 [2018-01-29 22:44:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:44:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:44:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:44:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:44:31,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2018-01-29 22:44:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:31,912 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:44:31,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-01-29 22:44:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:44:31,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:44:31,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:44:32,052 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:44:32,088 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:44:32,113 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:44:32,174 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 297 DAG size of output 241 [2018-01-29 22:44:32,725 WARN L146 SmtUtils]: Spent 550ms on a formula simplification. DAG size of input: 221 DAG size of output 210 [2018-01-29 22:44:32,876 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 109 DAG size of output 67 [2018-01-29 22:44:34,018 WARN L146 SmtUtils]: Spent 1137ms on a formula simplification. DAG size of input: 284 DAG size of output 166 [2018-01-29 22:44:34,619 WARN L146 SmtUtils]: Spent 581ms on a formula simplification. DAG size of input: 264 DAG size of output 105 [2018-01-29 22:44:34,684 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,685 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,685 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:44:34,685 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,685 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 572) the Hoare annotation is: true [2018-01-29 22:44:34,685 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,685 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 572) the Hoare annotation is: true [2018-01-29 22:44:34,685 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,685 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 555) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr15RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,686 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 554) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr16RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L540''''(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L550''(lines 550 551) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L550'''''(line 550) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L548''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L554''(line 554) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr3RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,687 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr13RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr2RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr8RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L548''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L543'(lines 543 555) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr5RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L547'(lines 547 554) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L540'''(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr10RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyFINAL(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr6RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,688 INFO L399 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point cstpncpyEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr11RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr12RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,689 INFO L399 ceAbstractionStarter]: For program point L548'''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L395 ceAbstractionStarter]: At program point L547'''(lines 547 554) the Hoare annotation is: (let ((.cse23 (select |#length| cstpncpy_~s~3.base)) (.cse28 (select |old(#valid)| |cstpncpy_~#dst.base|)) (.cse29 (select |#length| cstpncpy_~src.base)) (.cse30 (+ cstpncpy_~d~3.offset cstpncpy_~n)) (.cse8 (select |#length| cstpncpy_~d~3.base)) (.cse27 (select |#length| |cstpncpy_#in~dst.base|))) (let ((.cse12 (= |cstpncpy_#in~n| .cse27)) (.cse22 (select |old(#length)| |cstpncpy_#in~dst.base|)) (.cse20 (<= .cse30 .cse8)) (.cse21 (<= .cse8 .cse30)) (.cse18 (<= 1 .cse29)) (.cse24 (<= 1 cstpncpy_~s~3.offset)) (.cse9 (= 0 cstpncpy_~src.offset)) (.cse10 (not (= cstpncpy_~d~3.base cstpncpy_~s~3.base))) (.cse0 (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))) (.cse11 (not (= cstpncpy_~src.base cstpncpy_~d~3.base))) (.cse1 (= (store |#valid| |cstpncpy_~#dst.base| .cse28) |old(#valid)|)) (.cse13 (not (= |cstpncpy_~#dst.base| cstpncpy_~s~3.base))) (.cse25 (<= |cstpncpy_#in~n| .cse27)) (.cse14 (= 0 (select (select |#memory_int| cstpncpy_~s~3.base) (+ .cse23 (- 1))))) (.cse15 (= (select (select |#memory_int| cstpncpy_~src.base) (+ .cse29 (- 1))) 0)) (.cse19 (<= (+ cstpncpy_~s~3.offset 1) .cse23)) (.cse16 (= 0 .cse28)) (.cse2 (= cstpncpy_~d~3.base |cstpncpy_#in~dst.base|)) (.cse17 (= |cstpncpy_~#dst.offset| 0)) (.cse3 (<= 1 (select |#length| |cstpncpy_#in~src.base|))) (.cse4 (= 4 (select |#length| |cstpncpy_~#dst.base|))) (.cse5 (= 1 (select |#valid| cstpncpy_~src.base))) (.cse26 (<= .cse27 |cstpncpy_#in~n|)) (.cse6 (= 1 (select |#valid| cstpncpy_~s~3.base))) (.cse7 (= 1 (select |#valid| |cstpncpy_~#dst.base|)))) (or (and .cse0 (= 0 cstpncpy_~s~3.offset) .cse1 (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= cstpncpy_~src.offset v_main_~nondetString~6.offset_BEFORE_CALL_1) (<= 1 main_~length~6) (= 0 (select (select |#memory_int| cstpncpy_~src.base) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |#length| cstpncpy_~src.base)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((main_~nondetString~6.offset Int)) (and (= (select (select |#memory_int| |cstpncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstpncpy_#in~src.base|) (- 1))) 0) (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0))) (= .cse8 cstpncpy_~n) .cse9 .cse10 .cse11 .cse12 .cse13 (<= cstpncpy_~d~3.offset 0) .cse14 .cse15 (<= 0 cstpncpy_~d~3.offset) .cse16 .cse17 (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= cstpncpy_~s~3.offset v_main_~nondetString~6.offset_BEFORE_CALL_1) (= 0 (select (select |#memory_int| cstpncpy_~s~3.base) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |#length| cstpncpy_~s~3.base))))) (= |cstpncpy_#in~src.base| |cstpncpy_#in~dst.base|) (and .cse18 .cse0 .cse1 (not (= (mod (+ .cse8 4294967294) 4294967296) 0)) .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 cstpncpy_~s~3.offset) .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 (= 2 cstpncpy_~d~3.offset) .cse14 (<= 2 .cse8) .cse15 .cse16 .cse17 .cse21) (not (= 0 |cstpncpy_#in~dst.offset|)) (< .cse22 1) (< |cstpncpy_#in~n| .cse22) (< .cse22 |cstpncpy_#in~n|) (not (= 0 |cstpncpy_#in~src.offset|)) (not (= 0 (select (select |old(#memory_int)| |cstpncpy_#in~src.base|) (+ (select |old(#length)| |cstpncpy_#in~src.base|) (- 1))))) (not (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= |cstpncpy_#in~src.offset| v_main_~nondetString~6.offset_BEFORE_CALL_1) (= 0 (select (select |old(#memory_int)| |cstpncpy_#in~src.base|) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |old(#length)| |cstpncpy_#in~src.base|))))) (and (not (= .cse23 cstpncpy_~s~3.offset)) .cse18 .cse24 .cse9 .cse10 .cse0 .cse11 .cse1 .cse13 (<= 3 cstpncpy_~d~3.offset) .cse25 (<= cstpncpy_~s~3.offset .cse23) .cse20 .cse14 .cse15 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse26 .cse6 .cse7 (<= (+ cstpncpy_~d~3.offset 1) .cse8) .cse21) (not (= (select |old(#valid)| |cstpncpy_#in~src.base|) 1)) (and .cse18 .cse24 .cse9 .cse10 .cse0 .cse11 (not (= 0 (mod (+ .cse8 4294967295) 4294967296))) .cse1 .cse13 (or (<= cstpncpy_~s~3.offset 1) (<= (+ cstpncpy_~s~3.offset 2) .cse23)) (= cstpncpy_~d~3.offset 1) .cse25 .cse14 .cse15 .cse19 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse26 (= .cse8 (+ cstpncpy_~n 1)) .cse6 .cse7) (not (= 1 (select |old(#valid)| |cstpncpy_#in~dst.base|)))))) [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr7RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L548'''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L395 ceAbstractionStarter]: At program point L550''''''(lines 550 551) the Hoare annotation is: (let ((.cse9 (select |old(#valid)| |cstpncpy_~#dst.base|))) (let ((.cse6 (= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|))) (.cse3 (= (store |#valid| |cstpncpy_~#dst.base| .cse9) |old(#valid)|)) (.cse5 (= 0 .cse9)) (.cse4 (and (<= 1 (select |#length| cstpncpy_~src.base)) (= (select |#valid| |cstpncpy_#in~src.base|) 1) (= |cstpncpy_~#dst.offset| 0) (<= 1 (select |#length| |cstpncpy_#in~src.base|)) (= 1 (select |#valid| cstpncpy_~src.base)) (= 0 cstpncpy_~src.offset) (= 1 (select |#valid| cstpncpy_~s~3.base)) (= (select |#length| |cstpncpy_~#dst.base|) 4) (= 1 (select |#valid| |cstpncpy_~#dst.base|)))) (.cse2 (select |#length| cstpncpy_~d~3.base)) (.cse8 (select |old(#length)| |cstpncpy_#in~dst.base|))) (or (let ((.cse1 (+ .cse2 1)) (.cse0 (+ cstpncpy_~d~3.offset cstpncpy_~n))) (and (<= .cse0 .cse1) (<= 2 cstpncpy_~d~3.offset) (<= .cse1 .cse0) (<= cstpncpy_~d~3.offset .cse2) (and (= 1 (select |#valid| cstpncpy_~d~3.base)) .cse3 .cse4 .cse5 .cse6))) (let ((.cse7 (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and .cse6 .cse3 (= .cse7 |cstpncpy_#in~dst.base|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= cstpncpy_~d~3.base .cse7) (<= 1 cstpncpy_~d~3.offset) .cse5 (<= cstpncpy_~d~3.offset 1) .cse4 (= .cse2 cstpncpy_~n))) (not (= 0 |cstpncpy_#in~dst.offset|)) (not (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= |cstpncpy_#in~src.offset| v_main_~nondetString~6.offset_BEFORE_CALL_1) (= 0 (select (select |old(#memory_int)| |cstpncpy_#in~src.base|) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |old(#length)| |cstpncpy_#in~src.base|))))) (not (= 1 (select |old(#valid)| |cstpncpy_#in~dst.base|))) (= |cstpncpy_#in~src.base| |cstpncpy_#in~dst.base|) (not (= |cstpncpy_#in~n| .cse8)) (< .cse8 1) (not (= 0 |cstpncpy_#in~src.offset|)) (not (= 0 (select (select |old(#memory_int)| |cstpncpy_#in~src.base|) (+ (select |old(#length)| |cstpncpy_#in~src.base|) (- 1))))) (not (= (select |old(#valid)| |cstpncpy_#in~src.base|) 1))))) [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L550(lines 550 551) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-29 22:44:34,690 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr17RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr9RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr4RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L395 ceAbstractionStarter]: At program point cstpncpyENTRY(lines 540 557) the Hoare annotation is: (let ((.cse1 (select |old(#length)| |cstpncpy_#in~dst.base|))) (or (= |cstpncpy_#in~src.base| |cstpncpy_#in~dst.base|) (let ((.cse0 (select |#length| |cstpncpy_#in~dst.base|))) (and (<= 1 (select |#length| |cstpncpy_#in~src.base|)) (= |#valid| |old(#valid)|) (<= .cse0 |cstpncpy_#in~n|) (exists ((main_~nondetString~6.offset Int)) (and (= (select (select |#memory_int| |cstpncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstpncpy_#in~src.base|) (- 1))) 0) (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0))) (<= |cstpncpy_#in~n| .cse0))) (not (= 0 |cstpncpy_#in~dst.offset|)) (< .cse1 1) (< |cstpncpy_#in~n| .cse1) (< .cse1 |cstpncpy_#in~n|) (not (= 0 |cstpncpy_#in~src.offset|)) (not (= 0 (select (select |old(#memory_int)| |cstpncpy_#in~src.base|) (+ (select |old(#length)| |cstpncpy_#in~src.base|) (- 1))))) (not (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= |cstpncpy_#in~src.offset| v_main_~nondetString~6.offset_BEFORE_CALL_1) (= 0 (select (select |old(#memory_int)| |cstpncpy_#in~src.base|) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |old(#length)| |cstpncpy_#in~src.base|))))) (not (= (select |old(#valid)| |cstpncpy_#in~src.base|) 1)) (not (= 1 (select |old(#valid)| |cstpncpy_#in~dst.base|))))) [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point L540''(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point L548''''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-29 22:44:34,691 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point cstpncpyErr14RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 558 572) no Hoare annotation was computed. [2018-01-29 22:44:34,692 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L564'(lines 564 566) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 558 572) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 558 572) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 558 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L561''(lines 561 563) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-29 22:44:34,693 INFO L399 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-29 22:44:34,694 INFO L395 ceAbstractionStarter]: At program point L569'(line 569) the Hoare annotation is: (and (= 0 |main_#t~malloc16.offset|) (exists ((main_~length~6 Int)) (and (<= (+ main_~nondetString~6.offset main_~length~6) (select |#length| main_~nondetString~6.base)) (<= 1 main_~length~6) (= 0 (select (select |#memory_int| main_~nondetString~6.base) (+ main_~nondetString~6.offset main_~length~6 (- 1)))))) (<= 1 main_~n~6) (not (= main_~nondetArea~6.base |main_#t~malloc16.base|)) (= 0 main_~nondetArea~6.offset) (= 0 |main_#t~malloc15.offset|) (= 1 (select |#valid| main_~nondetArea~6.base)) (<= main_~n~6 2147483647) (= main_~length~6 (select |#length| |main_#t~malloc16.base|)) (= main_~nondetString~6.base |main_#t~malloc16.base|) (= 1 (select |#valid| |main_#t~malloc16.base|)) (= (store (store |#valid| |main_#t~malloc16.base| 0) |main_#t~malloc15.base| 0) |old(#valid)|) (= main_~nondetArea~6.base |main_#t~malloc15.base|) (= 0 main_~nondetString~6.offset) (= 0 (select (select |#memory_int| main_~nondetString~6.base) (+ main_~nondetString~6.offset (+ (select |#length| main_~nondetString~6.base) (- 1))))) (= (select |#length| main_~nondetArea~6.base) main_~n~6)) [2018-01-29 22:44:34,694 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-29 22:44:34,694 INFO L399 ceAbstractionStarter]: For program point L567''(line 567) no Hoare annotation was computed. [2018-01-29 22:44:34,694 INFO L399 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-29 22:44:34,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,715 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,716 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,749 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,750 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,750 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,750 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,751 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,751 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,752 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,752 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,752 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,753 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,753 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,753 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,754 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,754 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,754 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,755 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,770 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,770 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,770 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,770 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,771 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,772 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,772 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,772 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,772 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,772 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,778 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,779 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-01-29 22:44:34,779 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,780 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,780 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,780 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,780 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,781 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,781 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,784 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,787 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,787 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-01-29 22:44:34,787 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,789 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,790 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,791 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,792 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,793 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:44:34 BoogieIcfgContainer [2018-01-29 22:44:34,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:44:34,797 INFO L168 Benchmark]: Toolchain (without parser) took 68216.83 ms. Allocated memory was 303.0 MB in the beginning and 833.6 MB in the end (delta: 530.6 MB). Free memory was 263.1 MB in the beginning and 549.6 MB in the end (delta: -286.5 MB). Peak memory consumption was 498.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:44:34,798 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:44:34,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.69 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:44:34,798 INFO L168 Benchmark]: Boogie Preprocessor took 41.65 ms. Allocated memory is still 303.0 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:44:34,799 INFO L168 Benchmark]: RCFGBuilder took 427.13 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 223.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:44:34,799 INFO L168 Benchmark]: TraceAbstraction took 67513.44 ms. Allocated memory was 303.0 MB in the beginning and 833.6 MB in the end (delta: 530.6 MB). Free memory was 223.2 MB in the beginning and 549.6 MB in the end (delta: -326.4 MB). Peak memory consumption was 458.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:44:34,801 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.13 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.69 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.65 ms. Allocated memory is still 303.0 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 427.13 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 223.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67513.44 ms. Allocated memory was 303.0 MB in the beginning and 833.6 MB in the end (delta: 530.6 MB). Free memory was 223.2 MB in the beginning and 549.6 MB in the end (delta: -326.4 MB). Peak memory consumption was 458.0 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_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_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 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[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_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 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[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-29 22:44:34,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,819 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,827 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:44:34,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,839 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,840 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,840 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,840 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,840 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,840 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,843 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,843 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((((((((((!(dst == src) && 0 == s) && \valid[dst := \old(\valid)[dst]] == \old(\valid)) && (\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((src <= v_main_~nondetString~6.offset_BEFORE_CALL_1 && 1 <= main_~length~6) && 0 == unknown-#memory_int-unknown[src][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1]) && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= unknown-#length-unknown[src])) && d == dst) && 1 <= unknown-#length-unknown[src]) && 4 == unknown-#length-unknown[dst]) && 1 == \valid[src]) && 1 == \valid[s]) && 1 == \valid[dst]) && (\exists main_~nondetString~6.offset : int :: (unknown-#memory_int-unknown[src][main_~nondetString~6.offset + unknown-#length-unknown[src] + -1] == 0 && 0 <= main_~nondetString~6.offset) && main_~nondetString~6.offset <= 0)) && unknown-#length-unknown[d] == n) && 0 == src) && !(d == s)) && !(src == d)) && \old(n) == unknown-#length-unknown[dst]) && !(dst == s)) && d <= 0) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 0 <= d) && 0 == \old(\valid)[dst]) && dst == 0) && (\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~6 && s <= v_main_~nondetString~6.offset_BEFORE_CALL_1) && 0 == unknown-#memory_int-unknown[s][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1]) && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s])) || src == dst) || ((((((((((((((((((((((((1 <= unknown-#length-unknown[src] && !(dst == src)) && \valid[dst := \old(\valid)[dst]] == \old(\valid)) && !((unknown-#length-unknown[d] + 4294967294) % 4294967296 == 0)) && s + 1 <= unknown-#length-unknown[s]) && d == dst) && 1 <= unknown-#length-unknown[src]) && 4 == unknown-#length-unknown[dst]) && 1 == \valid[src]) && 1 == \valid[s]) && 1 == \valid[dst]) && 2 <= s) && 0 == src) && !(d == s)) && !(src == d)) && \old(n) == unknown-#length-unknown[dst]) && !(dst == s)) && d + n <= unknown-#length-unknown[d]) && 2 == d) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 2 <= unknown-#length-unknown[d]) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 0 == \old(\valid)[dst]) && dst == 0) && unknown-#length-unknown[d] <= d + n)) || !(0 == dst)) || \old(unknown-#length-unknown)[dst] < 1) || \old(n) < \old(unknown-#length-unknown)[dst]) || \old(unknown-#length-unknown)[dst] < \old(n)) || !(0 == src)) || !(0 == \old(unknown-#memory_int-unknown)[src][\old(unknown-#length-unknown)[src] + -1])) || !(\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~6 && src <= v_main_~nondetString~6.offset_BEFORE_CALL_1) && 0 == \old(unknown-#memory_int-unknown)[src][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1]) && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= \old(unknown-#length-unknown)[src])) || (((((((((((((((((((((((((!(unknown-#length-unknown[s] == s) && 1 <= unknown-#length-unknown[src]) && 1 <= s) && 0 == src) && !(d == s)) && !(dst == src)) && !(src == d)) && \valid[dst := \old(\valid)[dst]] == \old(\valid)) && !(dst == s)) && 3 <= d) && \old(n) <= unknown-#length-unknown[dst]) && s <= unknown-#length-unknown[s]) && d + n <= unknown-#length-unknown[d]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 0 == \old(\valid)[dst]) && d == dst) && dst == 0) && 1 <= unknown-#length-unknown[src]) && 4 == unknown-#length-unknown[dst]) && 1 == \valid[src]) && unknown-#length-unknown[dst] <= \old(n)) && 1 == \valid[s]) && 1 == \valid[dst]) && d + 1 <= unknown-#length-unknown[d]) && unknown-#length-unknown[d] <= d + n)) || !(\old(\valid)[src] == 1)) || ((((((((((((((((((((((((1 <= unknown-#length-unknown[src] && 1 <= s) && 0 == src) && !(d == s)) && !(dst == src)) && !(src == d)) && !(0 == (unknown-#length-unknown[d] + 4294967295) % 4294967296)) && \valid[dst := \old(\valid)[dst]] == \old(\valid)) && !(dst == s)) && (s <= 1 || s + 2 <= unknown-#length-unknown[s])) && d == 1) && \old(n) <= unknown-#length-unknown[dst]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && s + 1 <= unknown-#length-unknown[s]) && 0 == \old(\valid)[dst]) && d == dst) && dst == 0) && 1 <= unknown-#length-unknown[src]) && 4 == unknown-#length-unknown[dst]) && 1 == \valid[src]) && unknown-#length-unknown[dst] <= \old(n)) && unknown-#length-unknown[d] == n + 1) && 1 == \valid[s]) && 1 == \valid[dst])) || !(1 == \old(\valid)[dst]) - InvariantResult [Line: 550]: Loop Invariant [2018-01-29 22:44:34,844 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,844 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,849 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,850 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-01-29 22:44:34,850 WARN L343 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-01-29 22:44:34,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:44:34,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:44:34,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-01-29 22:44:34,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:44:34,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((d + n <= unknown-#length-unknown[d] + 1 && 2 <= d) && unknown-#length-unknown[d] + 1 <= d + n) && d <= unknown-#length-unknown[d]) && (((1 == \valid[d] && \valid[dst := \old(\valid)[dst]] == \old(\valid)) && (((((((1 <= unknown-#length-unknown[src] && \valid[src] == 1) && dst == 0) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[src]) && 0 == src) && 1 == \valid[s]) && unknown-#length-unknown[dst] == 4) && 1 == \valid[dst]) && 0 == \old(\valid)[dst]) && \old(n) == unknown-#length-unknown[dst]) || (((((((((\old(n) == unknown-#length-unknown[dst] && \valid[dst := \old(\valid)[dst]] == \old(\valid)) && #memory_$Pointer$[dst][dst] == dst) && 0 == #memory_$Pointer$[dst][dst]) && d == #memory_$Pointer$[dst][dst]) && 1 <= d) && 0 == \old(\valid)[dst]) && d <= 1) && (((((((1 <= unknown-#length-unknown[src] && \valid[src] == 1) && dst == 0) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[src]) && 0 == src) && 1 == \valid[s]) && unknown-#length-unknown[dst] == 4) && 1 == \valid[dst]) && unknown-#length-unknown[d] == n)) || !(0 == dst)) || !(\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~6 && src <= v_main_~nondetString~6.offset_BEFORE_CALL_1) && 0 == \old(unknown-#memory_int-unknown)[src][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1]) && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= \old(unknown-#length-unknown)[src])) || !(1 == \old(\valid)[dst])) || src == dst) || !(\old(n) == \old(unknown-#length-unknown)[dst])) || \old(unknown-#length-unknown)[dst] < 1) || !(0 == src)) || !(0 == \old(unknown-#memory_int-unknown)[src][\old(unknown-#length-unknown)[src] + -1])) || !(\old(\valid)[src] == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 21 error locations. SAFE Result, 67.3s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1574 SDtfs, 4856 SDslu, 21319 SDs, 0 SdLazy, 15214 SolverSat, 710 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1744 GetRequests, 656 SyntacticMatches, 31 SemanticMatches, 1057 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22143 ImplicationChecksByTransitivity, 45.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=19, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 187 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 27 NumberOfFragments, 1154 HoareAnnotationTreeSize, 8 FomulaSimplifications, 31477 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 8 FomulaSimplificationsInter, 34780 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 2150 NumberOfCodeBlocks, 2150 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2116 ConstructedInterpolants, 588 QuantifiedInterpolants, 3329036 SizeOfPredicates, 346 NumberOfNonLiveVariables, 2988 ConjunctsInSsa, 822 ConjunctsInUnsatCore, 34 InterpolantComputations, 12 PerfectInterpolantSequences, 177/1048 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-44-34-859.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-44-34-859.csv Received shutdown request...