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.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:45:59,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:45:59,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:45:59,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:45:59,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:45:59,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:45:59,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:45:59,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:45:59,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:45:59,432 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:45:59,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:45:59,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:45:59,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:45:59,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:45:59,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:45:59,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:45:59,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:45:59,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:45:59,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:45:59,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:45:59,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:45:59,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:45:59,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:45:59,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:45:59,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:45:59,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:45:59,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:45:59,450 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:45:59,451 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:45:59,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:45:59,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:45:59,452 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.epf [2018-01-24 11:45:59,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:45:59,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:45:59,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:45:59,463 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:45:59,463 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:45:59,463 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:45:59,463 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:45:59,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:45:59,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:45:59,464 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:45:59,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:45:59,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:45:59,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:45:59,465 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:45:59,465 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:45:59,465 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:45:59,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:45:59,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:45:59,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:45:59,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:45:59,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:45:59,467 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:45:59,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:45:59,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:45:59,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:45:59,467 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:45:59,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:45:59,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:45:59,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:45:59,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:45:59,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:45:59,468 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:45:59,469 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:45:59,469 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:45:59,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:45:59,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:45:59,521 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:45:59,522 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:45:59,523 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:45:59,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:45:59,719 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:45:59,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:45:59,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:45:59,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:45:59,729 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:45:59,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb333df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59, skipping insertion in model container [2018-01-24 11:45:59,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,744 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:45:59,783 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:45:59,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:45:59,923 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:45:59,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59 WrapperNode [2018-01-24 11:45:59,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:45:59,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:45:59,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:45:59,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:45:59,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (1/1) ... [2018-01-24 11:45:59,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:45:59,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:45:59,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:45:59,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:45:59,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (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-24 11:46:00,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:46:00,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:46:00,021 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-24 11:46:00,021 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:46:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:46:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:46:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:46:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:46:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:46:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:46:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-24 11:46:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:46:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:46:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:46:00,250 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:46:00,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:46:00 BoogieIcfgContainer [2018-01-24 11:46:00,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:46:00,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:46:00,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:46:00,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:46:00,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:45:59" (1/3) ... [2018-01-24 11:46:00,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ced0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:46:00, skipping insertion in model container [2018-01-24 11:46:00,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:45:59" (2/3) ... [2018-01-24 11:46:00,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ced0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:46:00, skipping insertion in model container [2018-01-24 11:46:00,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:46:00" (3/3) ... [2018-01-24 11:46:00,258 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:46:00,265 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:46:00,270 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 11:46:00,317 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:46:00,318 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:46:00,318 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:46:00,318 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:46:00,318 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:46:00,318 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:46:00,318 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:46:00,319 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:46:00,320 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:46:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 11:46:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:46:00,349 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:00,350 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:00,350 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-01-24 11:46:00,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:00,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:00,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:00,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:00,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:00,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:00,577 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-24 11:46:00,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:00,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:46:00,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:46:00,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:46:00,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:46:00,688 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 11:46:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:00,878 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-01-24 11:46:00,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:46:00,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 11:46:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:00,887 INFO L225 Difference]: With dead ends: 79 [2018-01-24 11:46:00,888 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 11:46:00,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 11:46:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 11:46:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 11:46:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:46:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 11:46:00,926 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-01-24 11:46:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:00,926 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 11:46:00,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:46:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 11:46:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:46:00,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:00,927 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:00,928 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:00,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-01-24 11:46:00,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:00,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:00,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:00,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:00,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:00,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:01,088 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-24 11:46:01,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:01,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:46:01,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:01,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:01,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:01,090 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-01-24 11:46:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:01,248 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-24 11:46:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:01,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 11:46:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:01,250 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:46:01,250 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:46:01,251 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:46:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:46:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 11:46:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:46:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 11:46:01,259 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-01-24 11:46:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:01,260 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 11:46:01,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 11:46:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:46:01,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:01,260 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:01,260 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-01-24 11:46:01,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:01,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:01,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:01,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:01,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:01,333 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-24 11:46:01,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:01,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:46:01,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:46:01,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:46:01,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:46:01,335 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 11:46:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:01,494 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 11:46:01,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:46:01,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:46:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:01,496 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:46:01,496 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:46:01,497 INFO L525 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-24 11:46:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:46:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 11:46:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 11:46:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-01-24 11:46:01,504 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-01-24 11:46:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:01,505 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-01-24 11:46:01,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:46:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-01-24 11:46:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:46:01,505 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:01,506 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:01,506 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:01,506 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-01-24 11:46:01,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:01,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:01,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:01,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:01,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:01,610 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-24 11:46:01,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:01,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:46:01,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:46:01,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:46:01,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:46:01,611 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-01-24 11:46:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:01,648 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-01-24 11:46:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:01,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:46:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:01,649 INFO L225 Difference]: With dead ends: 49 [2018-01-24 11:46:01,649 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:46:01,650 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:46:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 11:46:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 11:46:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-24 11:46:01,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-01-24 11:46:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:01,656 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-24 11:46:01,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:46:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-24 11:46:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:46:01,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:01,658 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:01,658 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-01-24 11:46:01,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:01,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:01,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:01,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:01,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:01,715 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-24 11:46:01,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:01,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:46:01,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:46:01,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:46:01,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:46:01,716 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-01-24 11:46:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:01,777 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-24 11:46:01,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:46:01,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 11:46:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:01,778 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:46:01,778 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:46:01,779 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:46:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:46:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:46:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-24 11:46:01,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-24 11:46:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:01,785 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-24 11:46:01,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:46:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-24 11:46:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:46:01,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:01,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:01,787 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-01-24 11:46:01,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:01,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:01,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:01,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:01,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:01,948 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-24 11:46:01,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:01,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:46:01,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:46:01,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:46:01,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:46:01,950 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-01-24 11:46:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:02,066 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 11:46:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:46:02,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 11:46:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:02,070 INFO L225 Difference]: With dead ends: 63 [2018-01-24 11:46:02,070 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 11:46:02,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:46:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 11:46:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 11:46:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:46:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 11:46:02,076 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-01-24 11:46:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:02,077 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 11:46:02,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:46:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 11:46:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:46:02,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:02,078 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:02,078 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-01-24 11:46:02,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:02,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:02,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:02,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:02,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:02,137 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-24 11:46:02,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:02,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:46:02,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:02,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:02,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:02,139 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 11:46:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:02,253 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 11:46:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:02,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 11:46:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:02,256 INFO L225 Difference]: With dead ends: 53 [2018-01-24 11:46:02,256 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 11:46:02,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:46:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 11:46:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 11:46:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:46:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 11:46:02,264 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-01-24 11:46:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:02,264 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 11:46:02,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 11:46:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:46:02,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:02,265 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:02,265 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-01-24 11:46:02,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:02,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:02,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:02,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:02,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:02,395 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-24 11:46:02,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:02,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:46:02,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:46:02,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:46:02,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:46:02,396 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 11:46:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:02,519 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 11:46:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:46:02,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 11:46:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:02,520 INFO L225 Difference]: With dead ends: 63 [2018-01-24 11:46:02,520 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 11:46:02,521 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:46:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 11:46:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 11:46:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:46:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 11:46:02,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-01-24 11:46:02,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:02,527 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 11:46:02,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:46:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 11:46:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:46:02,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:02,529 INFO L322 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-24 11:46:02,529 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-01-24 11:46:02,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:02,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:02,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:02,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:02,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:02,629 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-24 11:46:02,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:02,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:46:02,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:02,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:02,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:02,630 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 11:46:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:02,742 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 11:46:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:02,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 11:46:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:02,743 INFO L225 Difference]: With dead ends: 53 [2018-01-24 11:46:02,743 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 11:46:02,743 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:46:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 11:46:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 11:46:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:46:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 11:46:02,747 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 11:46:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:02,747 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 11:46:02,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 11:46:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:46:02,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:02,748 INFO L322 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-24 11:46:02,748 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-01-24 11:46:02,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:02,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:02,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:02,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:02,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:02,931 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-24 11:46:02,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:02,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:46:02,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:46:02,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:46:02,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:46:02,933 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 11:46:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:03,112 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-24 11:46:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:46:03,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 11:46:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:03,113 INFO L225 Difference]: With dead ends: 64 [2018-01-24 11:46:03,113 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 11:46:03,114 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:46:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 11:46:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-01-24 11:46:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:46:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 11:46:03,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-01-24 11:46:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:03,120 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 11:46:03,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:46:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 11:46:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:46:03,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:03,121 INFO L322 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-24 11:46:03,122 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-01-24 11:46:03,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:03,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:03,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:03,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:03,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:03,168 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-24 11:46:03,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:03,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:46:03,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:03,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:03,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:03,170 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 11:46:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:03,223 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 11:46:03,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:03,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 11:46:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:03,224 INFO L225 Difference]: With dead ends: 53 [2018-01-24 11:46:03,224 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 11:46:03,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:46:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 11:46:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 11:46:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:46:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 11:46:03,231 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 11:46:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:03,231 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 11:46:03,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 11:46:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:46:03,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:03,233 INFO L322 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-24 11:46:03,233 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:03,233 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-01-24 11:46:03,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:03,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:03,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:03,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:03,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:03,310 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-24 11:46:03,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:03,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:46:03,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:46:03,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:46:03,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:46:03,311 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 11:46:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:03,410 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-01-24 11:46:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:46:03,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 11:46:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:03,411 INFO L225 Difference]: With dead ends: 60 [2018-01-24 11:46:03,411 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 11:46:03,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:46:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 11:46:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 11:46:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:46:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-01-24 11:46:03,417 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-01-24 11:46:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:03,417 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-01-24 11:46:03,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:46:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-01-24 11:46:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:46:03,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:03,418 INFO L322 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] [2018-01-24 11:46:03,418 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-01-24 11:46:03,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:03,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:03,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:03,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:03,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:03,720 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-24 11:46:03,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:03,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:46:03,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:46:03,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:46:03,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:46:03,721 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 11 states. [2018-01-24 11:46:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:03,911 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-01-24 11:46:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:46:03,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-24 11:46:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:03,912 INFO L225 Difference]: With dead ends: 85 [2018-01-24 11:46:03,912 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 11:46:03,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:46:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 11:46:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2018-01-24 11:46:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 11:46:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2018-01-24 11:46:03,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 26 [2018-01-24 11:46:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:03,919 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2018-01-24 11:46:03,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:46:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-01-24 11:46:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:46:03,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:03,920 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:03,921 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-01-24 11:46:03,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:03,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:03,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:03,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:03,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:46:04,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:04,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:46:04,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:04,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:04,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:04,048 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 6 states. [2018-01-24 11:46:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:04,123 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-01-24 11:46:04,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:04,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 11:46:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:04,124 INFO L225 Difference]: With dead ends: 80 [2018-01-24 11:46:04,124 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 11:46:04,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:46:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 11:46:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-24 11:46:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 11:46:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-01-24 11:46:04,129 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2018-01-24 11:46:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:04,129 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-01-24 11:46:04,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-01-24 11:46:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:46:04,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:04,131 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:04,131 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-01-24 11:46:04,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:04,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:04,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:04,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:04,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:04,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:04,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:04,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:46:04,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:46:04,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:46:04,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:46:04,344 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2018-01-24 11:46:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:04,486 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-24 11:46:04,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:46:04,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-24 11:46:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:04,487 INFO L225 Difference]: With dead ends: 138 [2018-01-24 11:46:04,488 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 11:46:04,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:46:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 11:46:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-01-24 11:46:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 11:46:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-24 11:46:04,496 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-01-24 11:46:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:04,496 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-24 11:46:04,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:46:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-24 11:46:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:46:04,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:04,498 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:04,498 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 505638783, now seen corresponding path program 1 times [2018-01-24 11:46:04,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:04,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:04,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:04,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:04,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:04,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:46:04,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:04,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:46:04,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:04,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:04,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:04,610 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2018-01-24 11:46:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:04,680 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-01-24 11:46:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:46:04,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-24 11:46:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:04,681 INFO L225 Difference]: With dead ends: 128 [2018-01-24 11:46:04,682 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 11:46:04,682 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:46:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 11:46:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 11:46:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 11:46:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-01-24 11:46:04,689 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 27 [2018-01-24 11:46:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:04,690 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-01-24 11:46:04,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-01-24 11:46:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:46:04,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:04,691 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:04,691 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-01-24 11:46:04,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:04,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:04,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:04,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:04,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:04,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:04,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:04,883 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-24 11:46:04,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:04,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:04,997 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-24 11:46:05,000 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-24 11:46:05,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:05,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:05,011 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-24 11:46:05,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:46:05,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, 0 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-24 11:46:05,185 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-24 11:46:05,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:05,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:05,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:05,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 11:46:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:05,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:05,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-01-24 11:46:05,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:46:05,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:46:05,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:46:05,310 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 17 states. [2018-01-24 11:46:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:07,392 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2018-01-24 11:46:07,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:46:07,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-01-24 11:46:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:07,425 INFO L225 Difference]: With dead ends: 135 [2018-01-24 11:46:07,425 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 11:46:07,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:46:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 11:46:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-01-24 11:46:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 11:46:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-01-24 11:46:07,436 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2018-01-24 11:46:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:07,436 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-01-24 11:46:07,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:46:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-01-24 11:46:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:46:07,437 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:07,437 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:07,438 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-01-24 11:46:07,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:07,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:07,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:07,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:07,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:07,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:07,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:07,635 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-24 11:46:07,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:07,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:07,683 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-24 11:46:07,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:07,691 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-24 11:46:07,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:07,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:07,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:46:07,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:07,748 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-24 11:46:07,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:07,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:07,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:07,763 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-24 11:46:07,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:07,771 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-24 11:46:07,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 11:46:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:08,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:08,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-01-24 11:46:08,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:46:08,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:46:08,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:46:08,050 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 22 states. [2018-01-24 11:46:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:08,676 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-01-24 11:46:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:46:08,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-01-24 11:46:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:08,677 INFO L225 Difference]: With dead ends: 113 [2018-01-24 11:46:08,677 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 11:46:08,678 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-01-24 11:46:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 11:46:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-01-24 11:46:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 11:46:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-01-24 11:46:08,686 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-01-24 11:46:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:08,686 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-01-24 11:46:08,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:46:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-01-24 11:46:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:46:08,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:08,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:08,687 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-01-24 11:46:08,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:08,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:08,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:08,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:08,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:08,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:08,959 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-24 11:46:08,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:08,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:46:08,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:46:08,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:46:08,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:46:08,960 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 8 states. [2018-01-24 11:46:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:09,165 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-01-24 11:46:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:46:09,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-24 11:46:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:09,167 INFO L225 Difference]: With dead ends: 131 [2018-01-24 11:46:09,167 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 11:46:09,167 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:46:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 11:46:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2018-01-24 11:46:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 11:46:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-01-24 11:46:09,175 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-01-24 11:46:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:09,176 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-01-24 11:46:09,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:46:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-01-24 11:46:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:46:09,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:09,177 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:09,177 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-01-24 11:46:09,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:09,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:09,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:09,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:09,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:09,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:09,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:09,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 11:46:09,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:46:09,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:46:09,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:46:09,352 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-01-24 11:46:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:09,688 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-01-24 11:46:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:46:09,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-24 11:46:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:09,690 INFO L225 Difference]: With dead ends: 127 [2018-01-24 11:46:09,690 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 11:46:09,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:46:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 11:46:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-01-24 11:46:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 11:46:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-01-24 11:46:09,699 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-01-24 11:46:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:09,699 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-01-24 11:46:09,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:46:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-01-24 11:46:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:46:09,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:09,700 INFO L322 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] [2018-01-24 11:46:09,700 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-01-24 11:46:09,701 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:09,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:09,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:09,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:09,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:09,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:09,787 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-24 11:46:09,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:46:09,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:46:09,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:46:09,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:46:09,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:46:09,788 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-01-24 11:46:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:09,896 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-24 11:46:09,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:46:09,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 11:46:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:09,897 INFO L225 Difference]: With dead ends: 92 [2018-01-24 11:46:09,897 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:46:09,898 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:46:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:46:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 11:46:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:46:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-24 11:46:09,903 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 30 [2018-01-24 11:46:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:09,903 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-24 11:46:09,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:46:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-24 11:46:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:46:09,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:09,904 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:09,904 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-01-24 11:46:09,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:09,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:09,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:09,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:09,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:09,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:10,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:10,214 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-24 11:46:10,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:10,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:10,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-24 11:46:10,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:46:10,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:10,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:10,259 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-24 11:46:10,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:46:10,291 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 14 treesize of output 11 [2018-01-24 11:46:10,293 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-24 11:46:10,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,303 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-24 11:46:10,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:46:10,381 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 22 treesize of output 23 [2018-01-24 11:46:10,386 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-24 11:46:10,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 11:46:10,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 11:46:10,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-24 11:46:10,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 5 treesize of output 1 [2018-01-24 11:46:10,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:10,484 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-24 11:46:10,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:10,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:10,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:10,497 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-24 11:46:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:10,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:10,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-01-24 11:46:10,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 11:46:10,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 11:46:10,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:46:10,554 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 23 states. [2018-01-24 11:46:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:11,240 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 11:46:11,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:46:11,240 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-01-24 11:46:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:11,241 INFO L225 Difference]: With dead ends: 65 [2018-01-24 11:46:11,241 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 11:46:11,241 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:46:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 11:46:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-01-24 11:46:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 11:46:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-24 11:46:11,246 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 30 [2018-01-24 11:46:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:11,247 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-24 11:46:11,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 11:46:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-24 11:46:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:46:11,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:11,248 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:11,248 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-01-24 11:46:11,248 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:11,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:11,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:11,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:11,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:11,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:11,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:11,424 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-24 11:46:11,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:11,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:11,462 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-24 11:46:11,464 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-24 11:46:11,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:11,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:11,480 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-24 11:46:11,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:46:11,633 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 20 treesize of output 16 [2018-01-24 11:46:11,640 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-24 11:46:11,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:11,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:11,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:11,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 11:46:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:11,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:11,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-01-24 11:46:11,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:46:11,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:46:11,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:46:11,706 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 17 states. [2018-01-24 11:46:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:14,459 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-24 11:46:14,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:46:14,460 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-01-24 11:46:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:14,461 INFO L225 Difference]: With dead ends: 68 [2018-01-24 11:46:14,461 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 11:46:14,461 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:46:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 11:46:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 11:46:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 11:46:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-24 11:46:14,466 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 32 [2018-01-24 11:46:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:14,466 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-24 11:46:14,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:46:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-24 11:46:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:46:14,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:14,467 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:14,467 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-01-24 11:46:14,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:14,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:14,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:14,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:14,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:14,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:14,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:14,916 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-24 11:46:14,933 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:46:14,954 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:14,964 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:14,969 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:46:14,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:14,978 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-24 11:46:14,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:14,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:14,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:46:14,993 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-24 11:46:14,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:15,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:15,004 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-24 11:46:15,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:46:15,048 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-24 11:46:15,050 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-24 11:46:15,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,057 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-24 11:46:15,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 11:46:15,185 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 24 treesize of output 25 [2018-01-24 11:46:15,188 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-24 11:46:15,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:15,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:46:15,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 11:46:15,278 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 22 treesize of output 18 [2018-01-24 11:46:15,283 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-24 11:46:15,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:15,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:15,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:15,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 11:46:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:15,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:15,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-01-24 11:46:15,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:46:15,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:46:15,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:46:15,366 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 26 states. [2018-01-24 11:46:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:16,375 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 11:46:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:46:16,375 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-01-24 11:46:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:16,376 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:46:16,376 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 11:46:16,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:46:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 11:46:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-24 11:46:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 11:46:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-24 11:46:16,380 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2018-01-24 11:46:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:16,380 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-24 11:46:16,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:46:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-24 11:46:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:46:16,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:16,381 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:16,381 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:16,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-01-24 11:46:16,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:16,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:16,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:16,382 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:46:16,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:16,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:16,598 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 20 DAG size of output 8 [2018-01-24 11:46:16,806 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 24 DAG size of output 15 [2018-01-24 11:46:17,014 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 24 DAG size of output 15 [2018-01-24 11:46:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:17,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:17,350 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-24 11:46:17,356 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:46:17,369 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:17,375 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:17,377 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:46:17,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:17,382 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-24 11:46:17,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:46:17,412 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-24 11:46:17,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:17,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:17,419 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-24 11:46:17,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:46:17,462 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-24 11:46:17,464 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-24 11:46:17,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,470 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-24 11:46:17,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 11:46:17,556 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 24 treesize of output 25 [2018-01-24 11:46:17,559 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-24 11:46:17,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:46:17,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-01-24 11:46:17,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-24 11:46:17,738 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-24 11:46:17,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:17,745 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 5 treesize of output 1 [2018-01-24 11:46:17,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:17,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:17,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:17,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-24 11:46:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:17,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:17,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-01-24 11:46:17,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-24 11:46:17,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-24 11:46:17,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-01-24 11:46:17,836 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 32 states. [2018-01-24 11:46:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:18,893 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 11:46:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:46:18,893 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-01-24 11:46:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:18,893 INFO L225 Difference]: With dead ends: 66 [2018-01-24 11:46:18,894 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:46:18,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=288, Invalid=1968, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 11:46:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:46:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 11:46:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:46:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 11:46:18,900 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 34 [2018-01-24 11:46:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:18,901 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 11:46:18,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-24 11:46:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 11:46:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:46:18,901 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:18,901 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:18,901 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-01-24 11:46:18,902 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:18,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:18,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:18,902 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:46:18,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:18,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:19,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:19,189 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-24 11:46:19,198 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:46:19,216 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:19,237 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:19,245 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:46:19,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:19,255 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-24 11:46:19,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:19,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, 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-24 11:46:19,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:19,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:19,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:46:19,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:19,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:19,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-24 11:46:19,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:19,305 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-24 11:46:19,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:19,312 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-24 11:46:19,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 11:46:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:19,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:19,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2018-01-24 11:46:19,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 11:46:19,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 11:46:19,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:46:19,625 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 21 states. [2018-01-24 11:46:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:20,114 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 11:46:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:46:20,114 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-01-24 11:46:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:20,115 INFO L225 Difference]: With dead ends: 67 [2018-01-24 11:46:20,115 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 11:46:20,116 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-01-24 11:46:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 11:46:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-24 11:46:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 11:46:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-24 11:46:20,122 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2018-01-24 11:46:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:20,123 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-24 11:46:20,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 11:46:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-24 11:46:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:46:20,123 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:20,123 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 11:46:20,124 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-01-24 11:46:20,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:20,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:20,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:20,125 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:46:20,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:20,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:20,620 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-24 11:46:20,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:20,621 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-24 11:46:20,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:20,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:20,663 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-24 11:46:20,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:46:20,673 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-24 11:46:20,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:20,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:20,680 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-24 11:46:20,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:46:20,711 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-24 11:46:20,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 12 treesize of output 11 [2018-01-24 11:46:20,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 11:46:20,839 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 23 treesize of output 24 [2018-01-24 11:46:20,841 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-24 11:46:20,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-01-24 11:46:20,916 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 23 treesize of output 24 [2018-01-24 11:46:20,923 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-24 11:46:20,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:20,934 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-24 11:46:20,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 11:46:21,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 11:46:21,031 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 5 treesize of output 1 [2018-01-24 11:46:21,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:21,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, 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-24 11:46:21,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:21,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:21,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:21,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-24 11:46:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:21,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:21,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-01-24 11:46:21,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 11:46:21,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 11:46:21,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:46:21,141 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 27 states. [2018-01-24 11:46:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:21,898 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-24 11:46:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:46:21,899 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-01-24 11:46:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:21,899 INFO L225 Difference]: With dead ends: 65 [2018-01-24 11:46:21,900 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 11:46:21,900 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 11:46:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 11:46:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 11:46:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:46:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-24 11:46:21,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 36 [2018-01-24 11:46:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:21,906 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-24 11:46:21,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 11:46:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-24 11:46:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:46:21,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:21,906 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:21,907 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-01-24 11:46:21,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:21,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:21,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:21,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:46:21,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:21,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:22,421 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 28 DAG size of output 28 [2018-01-24 11:46:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:22,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:22,545 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-24 11:46:22,549 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:46:22,560 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:22,568 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:46:22,571 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:46:22,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:22,576 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-24 11:46:22,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:46:22,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:22,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:22,584 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-24 11:46:22,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,588 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 6 treesize of output 5 [2018-01-24 11:46:22,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:46:22,626 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-24 11:46:22,628 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-24 11:46:22,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,634 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-24 11:46:22,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 11:46:22,812 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 24 treesize of output 25 [2018-01-24 11:46:22,814 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-24 11:46:22,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:22,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:46:22,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 11:46:22,894 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 22 treesize of output 18 [2018-01-24 11:46:22,902 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-24 11:46:22,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:46:22,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:22,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:46:22,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 11:46:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:46:22,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:22,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-01-24 11:46:22,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:46:22,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:46:22,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:46:22,986 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-01-24 11:46:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:23,759 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-24 11:46:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:46:23,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-01-24 11:46:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:23,760 INFO L225 Difference]: With dead ends: 52 [2018-01-24 11:46:23,760 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:46:23,761 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 11:46:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:46:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 11:46:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 11:46:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-24 11:46:23,764 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-01-24 11:46:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:23,765 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-24 11:46:23,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:46:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-24 11:46:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:46:23,765 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:46:23,765 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:46:23,765 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:46:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-01-24 11:46:23,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:46:23,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:46:23,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:23,767 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:46:23,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:46:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:46:23,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:46:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:46:24,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:46:24,035 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-24 11:46:24,039 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:46:24,052 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:46:24,057 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:46:24,064 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:46:24,072 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:46:24,076 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:46:24,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:46:24,083 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-24 11:46:24,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:24,088 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-24 11:46:24,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:24,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:24,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:46:24,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:24,125 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-24 11:46:24,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:24,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:24,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:46:24,133 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-24 11:46:24,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:46:24,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:46:24,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-01-24 11:46:24,354 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-24 11:46:24,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:46:24,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2018-01-24 11:46:24,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 11:46:24,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 11:46:24,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-01-24 11:46:24,376 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2018-01-24 11:46:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:46:25,364 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-24 11:46:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:46:25,364 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-01-24 11:46:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:46:25,364 INFO L225 Difference]: With dead ends: 55 [2018-01-24 11:46:25,364 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:46:25,365 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 11:46:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:46:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:46:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:46:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:46:25,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-24 11:46:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:46:25,365 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:46:25,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 11:46:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:46:25,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:46:25,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:46:25,737 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 91 DAG size of output 70 [2018-01-24 11:46:25,920 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 119 DAG size of output 76 [2018-01-24 11:46:26,532 WARN L146 SmtUtils]: Spent 609ms on a formula simplification. DAG size of input: 229 DAG size of output 141 [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,536 INFO L397 ceAbstractionStarter]: At program point cstrlcpyENTRY(lines 540 559) the Hoare annotation is: (let ((.cse9 (select |#length| |cstrlcpy_#in~dst.base|))) (let ((.cse0 (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (.cse1 (not (= 0 |cstrlcpy_#in~dst.offset|))) (.cse2 (not (= 1 (select |#valid| |cstrlcpy_#in~src.base|)))) (.cse4 (< 2147483647 |cstrlcpy_#in~siz|)) (.cse5 (not (= (select |#valid| |cstrlcpy_#in~dst.base|) 1))) (.cse6 (not (= .cse9 |cstrlcpy_#in~siz|))) (.cse3 (select |old(#memory_int)| |cstrlcpy_#in~src.base|)) (.cse7 (not (= 0 |cstrlcpy_#in~src.offset|))) (.cse8 (< .cse9 1))) (and (or (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|)) .cse0 .cse1 .cse2 (not (= (select .cse3 |cstrlcpy_#in~src.offset|) 0)) .cse4 .cse5 .cse6 (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_1 Int) (main_~length~6 Int)) (and (<= 1 main_~length~6) (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_1 main_~length~6 (- 1)))) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_1 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|)) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_1)))) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (not (= (select .cse3 (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))) 0)) (exists ((main_~nondetString2~6.offset Int)) (and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ main_~nondetString2~6.offset (select |#length| |cstrlcpy_#in~src.base|) (- 1)))) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))) .cse7 (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|))))) .cse8)))) [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point cstrlcpyFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-24 11:46:26,536 INFO L401 ceAbstractionStarter]: For program point L546'(lines 546 551) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr4RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr5RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point L547'(lines 547 550) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr7RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L397 ceAbstractionStarter]: At program point L547'''(lines 547 550) the Hoare annotation is: (let ((.cse2 (select |#length| cstrlcpy_~d~2.base)) (.cse27 (select |#length| |cstrlcpy_#in~dst.base|))) (let ((.cse0 (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (.cse12 (not (= 0 |cstrlcpy_#in~dst.offset|))) (.cse13 (not (= 1 (select |#valid| |cstrlcpy_#in~src.base|)))) (.cse15 (< 2147483647 |cstrlcpy_#in~siz|)) (.cse1 (<= cstrlcpy_~n~2 2147483647)) (.cse4 (= 0 cstrlcpy_~s~2.offset)) (.cse8 (select |#memory_int| |cstrlcpy_#in~src.base|)) (.cse7 (= 0 cstrlcpy_~d~2.offset)) (.cse16 (not (= (select |#valid| |cstrlcpy_#in~dst.base|) 1))) (.cse17 (not (= .cse27 |cstrlcpy_#in~siz|))) (.cse14 (select |old(#memory_int)| |cstrlcpy_#in~src.base|)) (.cse3 (<= 1 cstrlcpy_~siz)) (.cse6 (= 1 (select |#valid| cstrlcpy_~s~2.base))) (.cse9 (= 1 (select |#valid| cstrlcpy_~d~2.base))) (.cse10 (<= 1 .cse2)) (.cse11 (<= (div cstrlcpy_~siz 4294967296) 0)) (.cse18 (not (= 0 |cstrlcpy_#in~src.offset|))) (.cse19 (< .cse27 1)) (.cse5 (select |#length| cstrlcpy_~s~2.base))) (and (or .cse0 (and .cse1 (= .cse2 cstrlcpy_~n~2) .cse3 .cse4 (= 0 (select (select |#memory_int| cstrlcpy_~s~2.base) cstrlcpy_~s~2.offset)) (<= 1 .cse5) .cse6 .cse7 (= 0 (select .cse8 |cstrlcpy_#in~src.offset|)) .cse9 .cse10 .cse11) .cse12 .cse13 (not (= (select .cse14 |cstrlcpy_#in~src.offset|) 0)) .cse15 .cse16 .cse17 (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_1 Int) (main_~length~6 Int)) (and (<= 1 main_~length~6) (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_1 main_~length~6 (- 1)))) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_1 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|)) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_1)))) .cse18 .cse19) (let ((.cse25 (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))) (.cse21 (not (= cstrlcpy_~d~2.base cstrlcpy_~s~2.base))) (.cse22 (<= (div cstrlcpy_~n~2 4294967296) 0)) (.cse23 (<= (+ cstrlcpy_~s~2.offset 1) .cse5)) (.cse24 (exists ((main_~nondetString2~6.offset Int)) (and (= (select (select |#memory_int| cstrlcpy_~s~2.base) (+ (select |#length| cstrlcpy_~s~2.base) main_~nondetString2~6.offset (- 1))) 0) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))))) (or .cse0 (let ((.cse20 (+ cstrlcpy_~n~2 cstrlcpy_~d~2.offset))) (and (<= .cse2 .cse20) (<= 1 cstrlcpy_~d~2.offset) (<= .cse20 .cse2) .cse3 .cse21 (<= 2 cstrlcpy_~s~2.offset) .cse6 (<= 1 cstrlcpy_~n~2) .cse22 .cse9 .cse23 .cse11 .cse24)) .cse12 .cse13 .cse15 (and .cse1 .cse3 (<= cstrlcpy_~n~2 .cse2) .cse21 .cse4 (<= .cse2 cstrlcpy_~n~2) (= (select .cse8 .cse25) 0) .cse6 (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_3 Int) (main_~length~6 Int)) (and (<= 1 main_~length~6) (= 0 (select (select |#memory_int| cstrlcpy_~s~2.base) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_3 main_~length~6 (- 1)))) (<= cstrlcpy_~s~2.offset v_main_~nondetString2~6.offset_BEFORE_CALL_3) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_3 main_~length~6) (select |#length| cstrlcpy_~s~2.base)))) .cse7 .cse9 .cse10 .cse11 .cse24) .cse16 .cse17 (not (= (select .cse14 .cse25) 0)) (let ((.cse26 (+ cstrlcpy_~n~2 1))) (and (= cstrlcpy_~d~2.offset 1) (<= .cse26 .cse2) .cse3 .cse21 (<= .cse2 .cse26) (<= 1 cstrlcpy_~s~2.offset) .cse6 (not (= 0 (mod (+ .cse2 4294967295) 4294967296))) .cse22 .cse9 .cse23 .cse10 .cse11 .cse24)) .cse18 (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|))))) .cse19))))) [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point L553(lines 553 554) no Hoare annotation was computed. [2018-01-24 11:46:26,537 INFO L401 ceAbstractionStarter]: For program point L552(lines 552 557) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 556) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point cstrlcpyEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point L555''''(lines 555 556) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr6RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 575) the Hoare annotation is: true [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,538 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 575) the Hoare annotation is: true [2018-01-24 11:46:26,538 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L571'(line 571) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L570''(line 570) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L566'(lines 566 568) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L570'''(line 570) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-24 11:46:26,539 INFO L401 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-01-24 11:46:26,540 INFO L397 ceAbstractionStarter]: At program point L572(line 572) the Hoare annotation is: (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|))) (= 0 |main_#t~malloc10.offset|) (= 0 |main_#t~malloc11.offset|) (= (select |#valid| main_~nondetString1~6.base) 1) (= main_~length~6 (select |#length| main_~nondetString2~6.base)) (not (= |main_#t~malloc11.base| main_~nondetString1~6.base)) (exists ((main_~length~6 Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~6.base) (+ main_~nondetString2~6.offset main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= (+ main_~nondetString2~6.offset main_~length~6) (select |#length| main_~nondetString2~6.base)))) (exists ((main_~nondetString2~6.offset Int)) (and (= (select (select |#memory_int| main_~nondetString2~6.base) (+ main_~nondetString2~6.offset (select |#length| main_~nondetString2~6.base) (- 1))) 0) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))) (= 0 main_~nondetString2~6.offset) (<= main_~n~6 2147483647) (= main_~n~6 (select |#length| main_~nondetString1~6.base)) (not (= main_~nondetString2~6.base main_~nondetString1~6.base)) (= 1 (select |#valid| main_~nondetString2~6.base)) (= main_~length~6 (select |#length| |main_#t~malloc11.base|)) (or (< 1 main_~n~6) (= main_~n~6 1)) (= main_~n~6 (select |#length| |main_#t~malloc10.base|)) (= main_~nondetString1~6.offset 0) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= 1 (select |#valid| |main_#t~malloc11.base|))) [2018-01-24 11:46:26,540 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 560 575) no Hoare annotation was computed. [2018-01-24 11:46:26,540 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 560 575) no Hoare annotation was computed. [2018-01-24 11:46:26,540 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 560 575) no Hoare annotation was computed. [2018-01-24 11:46:26,540 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 560 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:46:26,540 INFO L401 ceAbstractionStarter]: For program point L563''(lines 563 565) no Hoare annotation was computed. [2018-01-24 11:46:26,540 INFO L401 ceAbstractionStarter]: For program point L569''(line 569) no Hoare annotation was computed. [2018-01-24 11:46:26,540 INFO L401 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-24 11:46:26,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,582 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,582 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,582 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:46:26 BoogieIcfgContainer [2018-01-24 11:46:26,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:46:26,598 INFO L168 Benchmark]: Toolchain (without parser) took 26877.66 ms. Allocated memory was 306.7 MB in the beginning and 637.0 MB in the end (delta: 330.3 MB). Free memory was 265.7 MB in the beginning and 573.1 MB in the end (delta: -307.3 MB). Peak memory consumption was 285.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:46:26,599 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 306.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:46:26,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.85 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:46:26,600 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:46:26,600 INFO L168 Benchmark]: RCFGBuilder took 281.81 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 233.0 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:46:26,600 INFO L168 Benchmark]: TraceAbstraction took 26344.70 ms. Allocated memory was 306.7 MB in the beginning and 637.0 MB in the end (delta: 330.3 MB). Free memory was 233.0 MB in the beginning and 573.1 MB in the end (delta: -340.1 MB). Peak memory consumption was 252.4 MB. Max. memory is 5.3 GB. [2018-01-24 11:46:26,602 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.24 ms. Allocated memory is still 306.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.85 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.08 ms. Allocated memory is still 306.7 MB. Free memory was 255.6 MB in the beginning and 253.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 281.81 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 233.0 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 26344.70 ms. Allocated memory was 306.7 MB in the beginning and 637.0 MB in the end (delta: 330.3 MB). Free memory was 233.0 MB in the beginning and 573.1 MB in the end (delta: -340.1 MB). Peak memory consumption was 252.4 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[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~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_~nondetString2~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_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~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_~nondetString2~6.offset_BEFORE_CALL_3,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_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,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_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,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_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,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_~nondetString2~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_~nondetString2~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_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~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_~nondetString2~6.offset_BEFORE_CALL_3,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_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,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_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,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_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 #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 #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 #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 #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 #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 #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 * 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 11:46:26,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:46:26,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:46:26,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-24 11:46:26,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:46:26,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-24 11:46:26,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,637 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,639 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,640 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:46:26,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:46:26,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((dst == src || (((((((((((n <= 2147483647 && unknown-#length-unknown[d] == n) && 1 <= siz) && 0 == s) && 0 == unknown-#memory_int-unknown[s][s]) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 0 == d) && 0 == unknown-#memory_int-unknown[src][src]) && 1 == \valid[d]) && 1 <= unknown-#length-unknown[d]) && siz / 4294967296 <= 0)) || !(0 == dst)) || !(1 == \valid[src])) || !(\old(unknown-#memory_int-unknown)[src][src] == 0)) || 2147483647 < \old(siz)) || !(\valid[dst] == 1)) || !(unknown-#length-unknown[dst] == \old(siz))) || !(\exists v_main_~nondetString2~6.offset_BEFORE_CALL_1 : int, main_~length~6 : int :: ((1 <= main_~length~6 && 0 == \old(unknown-#memory_int-unknown)[src][v_main_~nondetString2~6.offset_BEFORE_CALL_1 + main_~length~6 + -1]) && v_main_~nondetString2~6.offset_BEFORE_CALL_1 + main_~length~6 <= unknown-#length-unknown[src]) && src <= v_main_~nondetString2~6.offset_BEFORE_CALL_1)) || !(0 == src)) || unknown-#length-unknown[dst] < 1) && ((((((((((((dst == src || ((((((((((((unknown-#length-unknown[d] <= n + d && 1 <= d) && n + d <= unknown-#length-unknown[d]) && 1 <= siz) && !(d == s)) && 2 <= s) && 1 == \valid[s]) && 1 <= n) && n / 4294967296 <= 0) && 1 == \valid[d]) && s + 1 <= unknown-#length-unknown[s]) && siz / 4294967296 <= 0) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(0 == dst)) || !(1 == \valid[src])) || 2147483647 < \old(siz)) || (((((((((((((n <= 2147483647 && 1 <= siz) && n <= unknown-#length-unknown[d]) && !(d == s)) && 0 == s) && unknown-#length-unknown[d] <= n) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 1 == \valid[s]) && (\exists v_main_~nondetString2~6.offset_BEFORE_CALL_3 : int, main_~length~6 : int :: ((1 <= main_~length~6 && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString2~6.offset_BEFORE_CALL_3 + main_~length~6 + -1]) && s <= v_main_~nondetString2~6.offset_BEFORE_CALL_3) && v_main_~nondetString2~6.offset_BEFORE_CALL_3 + main_~length~6 <= unknown-#length-unknown[s])) && 0 == d) && 1 == \valid[d]) && 1 <= unknown-#length-unknown[d]) && siz / 4294967296 <= 0) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(\valid[dst] == 1)) || !(unknown-#length-unknown[dst] == \old(siz))) || !(\old(unknown-#memory_int-unknown)[src][unknown-#length-unknown[src] + -1] == 0)) || (((((((((((((d == 1 && n + 1 <= unknown-#length-unknown[d]) && 1 <= siz) && !(d == s)) && unknown-#length-unknown[d] <= n + 1) && 1 <= s) && 1 == \valid[s]) && !(0 == (unknown-#length-unknown[d] + 4294967295) % 4294967296)) && n / 4294967296 <= 0) && 1 == \valid[d]) && s + 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[d]) && siz / 4294967296 <= 0) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(0 == src)) || !(\exists v_main_~nondetString2~6.offset_BEFORE_CALL_2 : int, main_~length~6 : int :: ((0 == \old(unknown-#memory_int-unknown)[src][v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 + -1] && 1 <= main_~length~6) && src <= v_main_~nondetString2~6.offset_BEFORE_CALL_2) && v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 <= unknown-#length-unknown[src])) || unknown-#length-unknown[dst] < 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. SAFE Result, 26.2s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1071 SDtfs, 1949 SDslu, 5722 SDs, 0 SdLazy, 5316 SolverSat, 432 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 256 SyntacticMatches, 18 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=18, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 179 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 15 NumberOfFragments, 800 HoareAnnotationTreeSize, 9 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1489 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1083 NumberOfCodeBlocks, 1083 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1044 ConstructedInterpolants, 87 QuantifiedInterpolants, 356522 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1784 ConjunctsInSsa, 494 ConjunctsInUnsatCore, 39 InterpolantComputations, 19 PerfectInterpolantSequences, 22/225 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-46-26-650.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-46-26-650.csv Received shutdown request...