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_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:14:16,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:14:16,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:14:16,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:14:16,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:14:16,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:14:16,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:14:16,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:14:16,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:14:16,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:14:16,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:14:16,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:14:16,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:14:16,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:14:16,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:14:16,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:14:16,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:14:16,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:14:16,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:14:16,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:14:16,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:14:16,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:14:16,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:14:16,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:14:16,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:14:16,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:14:16,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:14:16,928 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:14:16,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:14:16,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:14:16,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:14:16,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:14:16,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:14:16,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:14:16,938 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:14:16,938 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:14:16,938 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:14:16,938 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:14:16,938 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:14:16,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:14:16,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:14:16,939 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:14:16,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:14:16,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:14:16,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:14:16,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:14:16,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:14:16,941 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:14:16,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:14:16,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:14:16,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:14:16,942 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:14:16,942 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:14:16,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:14:16,942 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:14:16,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:14:16,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:14:16,943 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:14:16,943 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:14:16,943 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:14:16,944 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:14:16,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:14:16,987 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:14:16,991 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:14:16,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:14:16,992 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:14:16,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:14:17,164 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:14:17,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:14:17,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:14:17,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:14:17,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:14:17,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17, skipping insertion in model container [2018-01-24 15:14:17,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,191 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:14:17,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:14:17,347 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:14:17,370 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:14:17,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17 WrapperNode [2018-01-24 15:14:17,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:14:17,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:14:17,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:14:17,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:14:17,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (1/1) ... [2018-01-24 15:14:17,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:14:17,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:14:17,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:14:17,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:14:17,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (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 15:14:17,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:14:17,469 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:14:17,470 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-24 15:14:17,470 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-24 15:14:17,470 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:14:17,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:14:17,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:14:17,720 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:14:17,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:14:17 BoogieIcfgContainer [2018-01-24 15:14:17,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:14:17,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:14:17,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:14:17,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:14:17,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:14:17" (1/3) ... [2018-01-24 15:14:17,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e34a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:14:17, skipping insertion in model container [2018-01-24 15:14:17,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:17" (2/3) ... [2018-01-24 15:14:17,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e34a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:14:17, skipping insertion in model container [2018-01-24 15:14:17,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:14:17" (3/3) ... [2018-01-24 15:14:17,726 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:14:17,732 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:14:17,738 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 15:14:17,781 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:14:17,781 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:14:17,781 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:14:17,781 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:14:17,781 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:14:17,781 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:14:17,781 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:14:17,782 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:14:17,782 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:14:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-24 15:14:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:14:17,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:17,809 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:17,809 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-01-24 15:14:17,815 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:17,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:17,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:17,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:17,855 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:17,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:18,024 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 15:14:18,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:18,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:14:18,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:18,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:14:18,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:14:18,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:14:18,115 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-24 15:14:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:18,295 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-01-24 15:14:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:14:18,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:14:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:18,304 INFO L225 Difference]: With dead ends: 83 [2018-01-24 15:14:18,305 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 15:14:18,308 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 15:14:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 15:14:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 15:14:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 15:14:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-24 15:14:18,340 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-01-24 15:14:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:18,341 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-24 15:14:18,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:14:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-24 15:14:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:14:18,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:18,342 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:18,342 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-01-24 15:14:18,342 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:18,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:18,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:18,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:18,488 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 15:14:18,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:18,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:14:18,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:18,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:14:18,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:14:18,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:18,492 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-01-24 15:14:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:18,571 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-01-24 15:14:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:14:18,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 15:14:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:18,573 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:14:18,573 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 15:14:18,574 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:14:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 15:14:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 15:14:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:14:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-24 15:14:18,581 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-01-24 15:14:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:18,581 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-24 15:14:18,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:14:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-24 15:14:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:14:18,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:18,582 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:18,582 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-01-24 15:14:18,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:18,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:18,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:18,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:18,628 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 15:14:18,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:18,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:14:18,629 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:18,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:14:18,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:14:18,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:14:18,630 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-01-24 15:14:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:18,699 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-24 15:14:18,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:14:18,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:14:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:18,701 INFO L225 Difference]: With dead ends: 56 [2018-01-24 15:14:18,701 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 15:14:18,702 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 15:14:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 15:14:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 15:14:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:14:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-24 15:14:18,709 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-01-24 15:14:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:18,709 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-24 15:14:18,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:14:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-24 15:14:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:14:18,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:18,710 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:18,710 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-01-24 15:14:18,711 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:18,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,712 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:18,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:18,807 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 15:14:18,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:18,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:14:18,808 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:18,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:14:18,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:14:18,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:14:18,809 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-01-24 15:14:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:18,868 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-01-24 15:14:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:14:18,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:14:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:18,870 INFO L225 Difference]: With dead ends: 55 [2018-01-24 15:14:18,870 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 15:14:18,870 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 15:14:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 15:14:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 15:14:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 15:14:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-24 15:14:18,877 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-01-24 15:14:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:18,877 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-24 15:14:18,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:14:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-24 15:14:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:14:18,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:18,878 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 15:14:18,879 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-01-24 15:14:18,879 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:18,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:18,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:18,880 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:18,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:18,962 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 15:14:18,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:18,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:14:18,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:18,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:14:18,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:14:18,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:14:18,963 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-01-24 15:14:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:19,061 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-01-24 15:14:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:14:19,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 15:14:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:19,063 INFO L225 Difference]: With dead ends: 54 [2018-01-24 15:14:19,063 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:14:19,063 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 15:14:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:14:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:14:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:14:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 15:14:19,071 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-01-24 15:14:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:19,072 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 15:14:19,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:14:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 15:14:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:14:19,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:19,073 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 15:14:19,073 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-01-24 15:14:19,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:19,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:19,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:19,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:19,185 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 15:14:19,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:19,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:14:19,186 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:19,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:14:19,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:14:19,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:14:19,187 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-01-24 15:14:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:19,299 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-24 15:14:19,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:14:19,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 15:14:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:19,303 INFO L225 Difference]: With dead ends: 77 [2018-01-24 15:14:19,303 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:14:19,304 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 15:14:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:14:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-01-24 15:14:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:14:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-01-24 15:14:19,312 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-01-24 15:14:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:19,313 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-01-24 15:14:19,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:14:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-01-24 15:14:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:14:19,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:19,314 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] [2018-01-24 15:14:19,314 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-01-24 15:14:19,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:19,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:19,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,316 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:19,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:19,362 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 15:14:19,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:19,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:14:19,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:19,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:14:19,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:14:19,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:14:19,364 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-01-24 15:14:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:19,422 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-01-24 15:14:19,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:14:19,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 15:14:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:19,424 INFO L225 Difference]: With dead ends: 61 [2018-01-24 15:14:19,424 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:14:19,425 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 15:14:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:14:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 15:14:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 15:14:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-01-24 15:14:19,431 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-01-24 15:14:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:19,431 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-01-24 15:14:19,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:14:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-01-24 15:14:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:14:19,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:19,432 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] [2018-01-24 15:14:19,432 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-01-24 15:14:19,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:19,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:19,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:19,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:19,557 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 15:14:19,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:19,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:14:19,557 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:19,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:14:19,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:14:19,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:14:19,558 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-01-24 15:14:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:19,668 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-01-24 15:14:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:14:19,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 15:14:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:19,669 INFO L225 Difference]: With dead ends: 70 [2018-01-24 15:14:19,670 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 15:14:19,670 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:14:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 15:14:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-01-24 15:14:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:14:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-01-24 15:14:19,677 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-01-24 15:14:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:19,677 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-01-24 15:14:19,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:14:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-01-24 15:14:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:14:19,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:19,679 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 15:14:19,679 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-01-24 15:14:19,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:19,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:19,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:19,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:19,835 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 15:14:19,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:19,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:14:19,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:19,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:14:19,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:14:19,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:19,838 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-01-24 15:14:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:19,981 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-01-24 15:14:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:14:19,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 15:14:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:19,982 INFO L225 Difference]: With dead ends: 61 [2018-01-24 15:14:19,982 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:14:19,982 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:14:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:14:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:14:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:14:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-24 15:14:19,986 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-01-24 15:14:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:19,987 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-24 15:14:19,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:14:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-24 15:14:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:14:19,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:19,987 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] [2018-01-24 15:14:19,987 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-01-24 15:14:19,988 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:19,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:19,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:19,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:20,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:20,018 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 15:14:20,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:20,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:14:20,018 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:20,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:14:20,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:14:20,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:14:20,019 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-01-24 15:14:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:20,026 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-01-24 15:14:20,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:14:20,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 15:14:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:20,027 INFO L225 Difference]: With dead ends: 69 [2018-01-24 15:14:20,027 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 15:14:20,028 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:14:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 15:14:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 15:14:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 15:14:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 15:14:20,034 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-01-24 15:14:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:20,034 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 15:14:20,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:14:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 15:14:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:14:20,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:20,036 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, 1, 1, 1, 1] [2018-01-24 15:14:20,036 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-01-24 15:14:20,036 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:20,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:20,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:20,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:20,037 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:20,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:20,070 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 15:14:20,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:20,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:14:20,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:20,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:14:20,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:14:20,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:14:20,072 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-01-24 15:14:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:20,079 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-24 15:14:20,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:14:20,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-24 15:14:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:20,080 INFO L225 Difference]: With dead ends: 68 [2018-01-24 15:14:20,080 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 15:14:20,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:14:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 15:14:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 15:14:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 15:14:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 15:14:20,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-01-24 15:14:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:20,085 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 15:14:20,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:14:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 15:14:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 15:14:20,087 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:20,087 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, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:20,087 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-01-24 15:14:20,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:20,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:20,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:20,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:20,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:20,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:20,315 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 15:14:20,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:20,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:14:20,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:20,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:14:20,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:14:20,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:14:20,317 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-01-24 15:14:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:20,597 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-24 15:14:20,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:14:20,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-01-24 15:14:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:20,599 INFO L225 Difference]: With dead ends: 89 [2018-01-24 15:14:20,599 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 15:14:20,600 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:14:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 15:14:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 15:14:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 15:14:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-24 15:14:20,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-01-24 15:14:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:20,604 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-24 15:14:20,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:14:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-24 15:14:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 15:14:20,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:20,605 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, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:20,605 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-01-24 15:14:20,605 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:20,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:20,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:20,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:20,606 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:20,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:20,990 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 15:14:20,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:20,990 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:20,991 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 15:14:20,992 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [47], [50], [51], [53], [54], [57], [65], [70], [71], [74], [79], [99], [100], [101], [103] [2018-01-24 15:14:21,037 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:14:21,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:14:22,789 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:14:22,790 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 12 different actions 24 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 15:14:22,821 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:14:22,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:22,821 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:14:22,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:22,832 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:22,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:22,918 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 15:14:22,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:22,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:22,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:14:22,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:22,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:22,999 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 15:14:22,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:14:23,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:14:23,096 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 15:14:23,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,107 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 15:14:23,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 15:14:23,180 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 25 treesize of output 26 [2018-01-24 15:14:23,184 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 15:14:23,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,254 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 15:14:23,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 15:14:23,565 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 15:14:23,577 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 14 treesize of output 11 [2018-01-24 15:14:23,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:23,594 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 8 treesize of output 1 [2018-01-24 15:14:23,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:23,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:23,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:23,609 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-24 15:14:23,745 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 15:14:23,745 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:24,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 15:14:24,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,137 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 13 treesize of output 11 [2018-01-24 15:14:24,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:24,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,185 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 15:14:24,225 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 15:14:24,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:24,247 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:14:24,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:24,250 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:24,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:24,307 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 15:14:24,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,342 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 15:14:24,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:24,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:24,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:24,397 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 15:14:24,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,404 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 15:14:24,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:14:24,475 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 15:14:24,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:14:24,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 15:14:24,526 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 29 treesize of output 30 [2018-01-24 15:14:24,528 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 15:14:24,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,537 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 15:14:24,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 15:14:24,854 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 31 treesize of output 29 [2018-01-24 15:14:24,857 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 10 treesize of output 1 [2018-01-24 15:14:24,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:24,866 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 15 treesize of output 16 [2018-01-24 15:14:24,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:24,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:24,877 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 15:14:24,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-01-24 15:14:25,023 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 15:14:25,023 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:25,280 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 13 treesize of output 11 [2018-01-24 15:14:25,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:25,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:25,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:25,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:25,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 15:14:25,458 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 15:14:25,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:25,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10, 14, 12] total 51 [2018-01-24 15:14:25,460 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:25,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 15:14:25,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 15:14:25,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2457, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 15:14:25,462 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-01-24 15:14:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:26,951 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-24 15:14:26,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:14:26,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-01-24 15:14:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:26,952 INFO L225 Difference]: With dead ends: 69 [2018-01-24 15:14:26,952 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 15:14:26,954 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=343, Invalid=3439, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 15:14:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 15:14:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-01-24 15:14:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 15:14:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-24 15:14:26,958 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-01-24 15:14:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:26,959 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-24 15:14:26,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 15:14:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-24 15:14:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:14:26,960 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:26,960 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] [2018-01-24 15:14:26,960 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-01-24 15:14:26,960 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:26,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:26,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:26,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:26,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:26,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:27,399 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 15:14:27,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:27,400 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:27,400 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 15:14:27,400 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [47], [50], [51], [54], [56], [57], [65], [70], [71], [74], [79], [99], [100], [101], [103] [2018-01-24 15:14:27,402 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:14:27,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:14:28,826 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:14:28,826 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 12 different actions 24 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 15:14:28,856 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:14:28,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:28,856 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:14:28,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:28,863 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:28,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:28,894 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 15:14:28,897 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 15:14:28,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:28,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:28,903 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 15:14:28,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:14:29,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-01-24 15:14:29,726 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 25 treesize of output 23 [2018-01-24 15:14:29,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:29,741 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 15 treesize of output 8 [2018-01-24 15:14:29,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:29,743 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 17 treesize of output 12 [2018-01-24 15:14:29,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:29,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 15:14:29,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:29,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:14:29,789 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 15:14:29,790 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-01-24 15:14:29,869 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 15:14:29,869 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:30,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 15:14:30,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 15:14:30,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-24 15:14:30,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 15:14:30,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 15:14:30,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,295 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-01-24 15:14:30,302 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 15:14:30,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:30,322 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:14:30,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:30,327 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:30,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:30,391 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 15:14:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:14:30,512 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 16 treesize of output 13 [2018-01-24 15:14:30,513 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 15:14:30,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:14:30,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-24 15:14:30,935 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 27 treesize of output 28 [2018-01-24 15:14:30,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:30,950 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 15 treesize of output 8 [2018-01-24 15:14:30,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,951 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 19 treesize of output 14 [2018-01-24 15:14:30,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:30,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2018-01-24 15:14:30,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:30,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:14:30,993 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 15:14:30,994 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:39, output treesize:31 [2018-01-24 15:14:31,109 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 15:14:31,109 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:31,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 15:14:31,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-24 15:14:31,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:31,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:31,275 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 15:14:31,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:14 [2018-01-24 15:14:31,359 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 15:14:31,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:31,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-24 15:14:31,361 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:31,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 15:14:31,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 15:14:31,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2223, Unknown=1, NotChecked=0, Total=2450 [2018-01-24 15:14:31,362 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 24 states. [2018-01-24 15:14:32,062 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 62 DAG size of output 49 [2018-01-24 15:14:32,235 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 49 DAG size of output 39 [2018-01-24 15:14:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:32,589 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-24 15:14:32,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:14:32,589 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-01-24 15:14:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:32,590 INFO L225 Difference]: With dead ends: 66 [2018-01-24 15:14:32,590 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 15:14:32,591 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=397, Invalid=3262, Unknown=1, NotChecked=0, Total=3660 [2018-01-24 15:14:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 15:14:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-24 15:14:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 15:14:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-24 15:14:32,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-01-24 15:14:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:32,596 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-24 15:14:32,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 15:14:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-24 15:14:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 15:14:32,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:32,598 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:32,598 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-01-24 15:14:32,598 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:32,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:32,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,599 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:32,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:33,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:33,038 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:33,038 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:14:33,038 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:14:33,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:33,039 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:14:33,044 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:14:33,044 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:14:33,059 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:33,066 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:33,069 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:14:33,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:33,074 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 15:14:33,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,084 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 15:14:33,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:33,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:33,120 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 15:14:33,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:33,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:33,128 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 15:14:33,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:14:33,170 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 15:14:33,172 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 15:14:33,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-24 15:14:33,206 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 29 treesize of output 30 [2018-01-24 15:14:33,207 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 15:14:33,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,217 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 15:14:33,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-24 15:14:33,459 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 32 treesize of output 30 [2018-01-24 15:14:33,463 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 10 treesize of output 1 [2018-01-24 15:14:33,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:33,473 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 15:14:33,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:33,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:33,487 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 15:14:33,487 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-24 15:14:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:33,609 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:34,247 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 41 treesize of output 39 [2018-01-24 15:14:34,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:34,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:34,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:34,292 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 39 treesize of output 37 [2018-01-24 15:14:34,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:34,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:34,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:34,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:34,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 15:14:37,691 WARN L143 SmtUtils]: Spent 3211ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 15:14:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:37,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:37,803 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:14:37,806 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:14:37,806 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:14:37,821 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:37,849 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:37,884 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:14:37,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:37,893 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 15:14:37,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,899 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 15:14:37,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:37,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:37,938 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 15:14:37,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:37,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:37,947 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 15:14:37,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:14:38,021 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 15:14:38,023 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 15:14:38,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:14:38,070 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 28 treesize of output 29 [2018-01-24 15:14:38,071 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 15:14:38,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,079 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 15:14:38,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-24 15:14:38,280 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 32 treesize of output 30 [2018-01-24 15:14:38,289 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 15:14:38,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,302 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 10 treesize of output 1 [2018-01-24 15:14:38,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,320 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 15:14:38,320 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-24 15:14:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:38,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:38,759 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 13 treesize of output 11 [2018-01-24 15:14:38,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:38,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,775 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 15:14:38,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 15:14:39,226 WARN L143 SmtUtils]: Spent 323ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 15:14:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:39,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:39,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12, 15, 13] total 49 [2018-01-24 15:14:39,459 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:39,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 15:14:39,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 15:14:39,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2288, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 15:14:39,461 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 26 states. [2018-01-24 15:14:40,186 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-01-24 15:14:40,481 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 64 DAG size of output 49 [2018-01-24 15:14:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:41,113 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-24 15:14:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 15:14:41,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-01-24 15:14:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:41,114 INFO L225 Difference]: With dead ends: 60 [2018-01-24 15:14:41,114 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 15:14:41,115 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=441, Invalid=3591, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 15:14:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 15:14:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-01-24 15:14:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 15:14:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 15:14:41,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-01-24 15:14:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:41,120 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 15:14:41,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 15:14:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 15:14:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 15:14:41,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:41,122 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:41,122 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 15:14:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-01-24 15:14:41,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:41,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:41,123 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:14:41,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:41,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:41,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:41,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:41,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:41,641 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:14:41,641 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:14:41,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:41,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:14:41,649 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:14:41,649 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:14:41,663 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:41,682 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:41,695 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:14:41,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:41,705 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 15:14:41,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:41,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:41,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:14:41,777 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 16 treesize of output 13 [2018-01-24 15:14:41,779 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 15:14:41,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:41,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:41,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:41,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 15:14:42,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-24 15:14:42,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-01-24 15:14:42,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:42,094 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 27 treesize of output 20 [2018-01-24 15:14:42,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:42,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 15:14:42,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:42,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:14:42,134 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 15:14:42,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:49 [2018-01-24 15:14:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:42,234 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:42,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2018-01-24 15:14:42,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 15:14:42,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:42,911 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 53 treesize of output 47 [2018-01-24 15:14:42,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-24 15:14:42,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:42,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:42,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:42,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,005 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 55 treesize of output 49 [2018-01-24 15:14:43,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 15:14:43,032 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:14:43,042 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 [2018-01-24 15:14:43,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-01-24 15:14:43,138 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-01-24 15:14:43,166 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-24 15:14:43,193 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:43,257 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:149, output treesize:98 [2018-01-24 15:14:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:43,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:43,394 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:14:43,397 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:14:43,397 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:14:43,414 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:43,439 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:43,481 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:14:43,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:43,490 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 15:14:43,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:14:43,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:14:43,534 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 15:14:43,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 15:14:43,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-24 15:14:43,924 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 26 treesize of output 19 [2018-01-24 15:14:43,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:43,942 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 19 treesize of output 17 [2018-01-24 15:14:43,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:43,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-01-24 15:14:43,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:43,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:14:43,993 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 15:14:43,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-01-24 15:14:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:44,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:44,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 15:14:44,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-24 15:14:44,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:44,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 15:14:44,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:44,483 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 15:14:44,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:44,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:44,498 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 15:14:44,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2018-01-24 15:14:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:44,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:44,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 15, 15] total 54 [2018-01-24 15:14:44,617 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:44,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 15:14:44,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 15:14:44,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2693, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 15:14:44,618 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 27 states. [2018-01-24 15:14:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:45,981 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-24 15:14:45,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 15:14:45,981 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-01-24 15:14:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:45,981 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:14:45,981 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:14:45,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=700, Invalid=4556, Unknown=0, NotChecked=0, Total=5256 [2018-01-24 15:14:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:14:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:14:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:14:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:14:45,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-24 15:14:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:45,983 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:14:45,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 15:14:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:14:45,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:14:45,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:14:46,387 WARN L146 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 101 DAG size of output 73 [2018-01-24 15:15:07,965 WARN L146 SmtUtils]: Spent 21535ms on a formula simplification. DAG size of input: 194 DAG size of output 154 [2018-01-24 15:15:07,969 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,969 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:15:07,969 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,969 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 569) the Hoare annotation is: true [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 569) the Hoare annotation is: true [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point L565'''(line 565) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point L561'(lines 561 563) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L397 ceAbstractionStarter]: At program point L568(line 568) the Hoare annotation is: (let ((.cse5 (select |#length| main_~nondetString1~4.base)) (.cse18 (select |#length| main_~nondetString2~4.base))) (let ((.cse2 (select |#memory_int| main_~nondetString2~4.base)) (.cse0 (= main_~length1~4 (select |#length| |main_#t~malloc13.base|))) (.cse3 (= 1 (select |#valid| |main_#t~malloc14.base|))) (.cse4 (= 1 (select |#valid| main_~nondetString1~4.base))) (.cse1 (select |#length| |main_#t~malloc14.base|)) (.cse6 (not (= main_~nondetString1~4.base main_~nondetString2~4.base))) (.cse7 (<= 1 main_~length2~4)) (.cse8 (= main_~nondetString2~4.offset 0)) (.cse9 (= |old(#valid)| (store (store |#valid| |main_#t~malloc13.base| (select (store |#valid| |main_#t~malloc13.base| 0) |main_#t~malloc13.base|)) |main_#t~malloc14.base| 0))) (.cse10 (= main_~length2~4 .cse18)) (.cse11 (= 0 |main_#t~malloc13.offset|)) (.cse12 (<= (+ main_~nondetString1~4.offset 1) .cse5)) (.cse13 (= 0 |main_#t~malloc14.offset|)) (.cse14 (= 1 (select |#valid| main_~nondetString2~4.base))) (.cse15 (= 1 (select |#valid| |main_#t~malloc13.base|))) (.cse16 (not (= |main_#t~malloc13.base| |main_#t~malloc14.base|))) (.cse17 (not (= main_~nondetString1~4.base |main_#t~malloc14.base|)))) (or (and .cse0 (= main_~length2~4 .cse1) (= 0 (select (select (store |#memory_int| main_~nondetString2~4.base (store .cse2 (+ main_~length2~4 main_~nondetString2~4.offset (- 1)) 0)) main_~nondetString1~4.base) main_~nondetString1~4.offset)) .cse3 .cse4 (= main_~length1~4 .cse5) .cse6 .cse7 .cse8 (<= main_~length1~4 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= 1 (+ main_~length1~4 main_~nondetString1~4.offset))) (and (= (select .cse2 (+ .cse18 main_~nondetString2~4.offset (- 1))) 0) .cse0 (= main_~nondetString1~4.offset 0) .cse3 .cse4 (= .cse1 main_~length2~4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse5 main_~length1~4) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse5 (- 1))) 0) .cse15 .cse16 .cse17)))) [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-24 15:15:07,970 INFO L401 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point L558''(lines 558 560) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 555 569) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 555 569) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point L558(lines 558 560) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 555 569) no Hoare annotation was computed. [2018-01-24 15:15:07,971 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 555 569) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:15:07,971 INFO L401 ceAbstractionStarter]: For program point L564''(line 564) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point L565'(line 565) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point L565''(line 565) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr1RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr0RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr3RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,972 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr9RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr6RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr5RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr7RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L545'''''''''(lines 545 550) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr4RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr8RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point cstrncmpEXIT(lines 540 554) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 15:15:07,973 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 15:15:07,974 INFO L404 ceAbstractionStarter]: At program point cstrncmpENTRY(lines 540 554) the Hoare annotation is: true [2018-01-24 15:15:07,974 INFO L401 ceAbstractionStarter]: For program point L545''''''(line 545) no Hoare annotation was computed. [2018-01-24 15:15:07,974 INFO L401 ceAbstractionStarter]: For program point cstrncmpErr2RequiresViolation(lines 1 569) no Hoare annotation was computed. [2018-01-24 15:15:07,974 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 15:15:07,974 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 15:15:07,974 INFO L397 ceAbstractionStarter]: At program point L545''''''''(lines 545 550) the Hoare annotation is: (let ((.cse15 (select |#length| cstrncmp_~s2.base)) (.cse14 (select |#length| cstrncmp_~s1.base))) (let ((.cse9 (not (= 0 |cstrncmp_#in~s1.offset|))) (.cse7 (not (= 1 (select |#valid| |cstrncmp_#in~s2.base|)))) (.cse8 (not (= (select |#valid| |cstrncmp_#in~s1.base|) 1))) (.cse16 (not (= 0 |cstrncmp_#in~s2.offset|))) (.cse10 (= cstrncmp_~s2.offset 0)) (.cse11 (= cstrncmp_~s1.offset 0)) (.cse2 (= 1 (select |#valid| cstrncmp_~s1.base))) (.cse12 (<= 1 .cse14)) (.cse13 (<= 1 .cse15)) (.cse6 (= 1 (select |#valid| cstrncmp_~s2.base)))) (and (let ((.cse0 (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= (select (select |#memory_int| main_~nondetString2~4.base) (+ (select |#length| main_~nondetString2~4.base) main_~nondetString2~4.offset (- 1))) 0) (not (= main_~nondetString2~4.base cstrncmp_~s1.base))))) (.cse1 (<= (+ cstrncmp_~s2.offset 1) .cse15)) (.cse3 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 0) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 1) cstrncmp_~s1.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s1.base) (- 1))) 0)))) (.cse4 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 0) (<= (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 1) cstrncmp_~s2.offset) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s2.base) (- 1))) 0)))) (.cse5 (<= (+ cstrncmp_~s1.offset 1) .cse14))) (or (and (<= 2 cstrncmp_~s2.offset) .cse0 (<= 2 cstrncmp_~s1.offset) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 0) (= (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 (select |#length| |cstrncmp_#in~s2.base|) (- 1))) 0) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_5) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 |cstrncmp_#in~s2.offset|)))) .cse7 (not (exists ((main_~nondetString2~4.offset Int) (main_~nondetString2~4.base Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~4.base) (+ main_~nondetString2~4.offset (select |#length| main_~nondetString2~4.base) (- 1)))) (not (= main_~nondetString2~4.base |cstrncmp_#in~s1.base|))))) (not (exists ((main_~length2~4 Int) (v_main_~nondetString2~4.offset_BEFORE_CALL_3 Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_3 (- 1))) 0) (<= |cstrncmp_#in~s2.offset| v_main_~nondetString2~4.offset_BEFORE_CALL_3) (<= 1 main_~length2~4) (<= (+ main_~length2~4 v_main_~nondetString2~4.offset_BEFORE_CALL_3) (select |#length| |cstrncmp_#in~s2.base|))))) .cse8 .cse9 (and (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 cstrncmp_~s1.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s1.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s1.base) (- 1))) 0))) .cse10 .cse11 .cse2 .cse12 .cse13 (exists ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 Int)) (and (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 0) (<= v_main_~nondetString2~4.offset_BEFORE_CALL_5 cstrncmp_~s2.offset) (<= 0 v_main_~nondetString2~4.offset_BEFORE_CALL_5) (= (select (select |#memory_int| cstrncmp_~s2.base) (+ v_main_~nondetString2~4.offset_BEFORE_CALL_5 (select |#length| cstrncmp_~s2.base) (- 1))) 0))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (or (<= (+ cstrncmp_~s1.offset 2) .cse14) (= 1 cstrncmp_~s1.offset)) (or (<= (+ cstrncmp_~s2.offset 2) .cse15) (= 1 cstrncmp_~s2.offset)) .cse4 .cse5 .cse6) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (= (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= |cstrncmp_#in~s1.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| |cstrncmp_#in~s1.base|)) (<= 1 main_~length1~4)))) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 Int)) (and (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_5 (select |#length| |cstrncmp_#in~s1.base|) (- 1)))) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 0) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_5) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_5 |cstrncmp_#in~s1.offset|)))) .cse16)) (or (< (select |#length| |cstrncmp_#in~s1.base|) 1) .cse9 .cse7 (not (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))) (< (select |#length| |cstrncmp_#in~s2.base|) 1) .cse8 .cse16 (and .cse10 .cse11 .cse2 .cse12 .cse13 (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)) .cse6))))) [2018-01-24 15:15:07,974 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-24 15:15:07,974 INFO L401 ceAbstractionStarter]: For program point cstrncmpFINAL(lines 540 554) no Hoare annotation was computed. [2018-01-24 15:15:07,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:07,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,990 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:07,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:07,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:07,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:07,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:07,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:07,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:07,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,995 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,996 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:07,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:07,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,997 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:07,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,024 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,025 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,026 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,034 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,048 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:15:08 BoogieIcfgContainer [2018-01-24 15:15:08,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:15:08,052 INFO L168 Benchmark]: Toolchain (without parser) took 50888.07 ms. Allocated memory was 299.9 MB in the beginning and 742.4 MB in the end (delta: 442.5 MB). Free memory was 259.9 MB in the beginning and 467.5 MB in the end (delta: -207.5 MB). Peak memory consumption was 235.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:08,053 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:15:08,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.67 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:08,054 INFO L168 Benchmark]: Boogie Preprocessor took 36.86 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:08,054 INFO L168 Benchmark]: RCFGBuilder took 304.69 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 227.0 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:08,055 INFO L168 Benchmark]: TraceAbstraction took 50329.69 ms. Allocated memory was 299.9 MB in the beginning and 742.4 MB in the end (delta: 442.5 MB). Free memory was 227.0 MB in the beginning and 467.5 MB in the end (delta: -240.5 MB). Peak memory consumption was 202.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:08,057 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.12 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.67 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.86 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 304.69 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 227.0 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50329.69 ms. Allocated memory was 299.9 MB in the beginning and 742.4 MB in the end (delta: 442.5 MB). Free memory was 227.0 MB in the beginning and 467.5 MB in the end (delta: -240.5 MB). Peak memory consumption was 202.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 352 LocStat_NO_SUPPORTING_DISEQUALITIES : 78 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 78 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.744533 RENAME_VARIABLES(MILLISECONDS) : 0.437367 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.686790 PROJECTAWAY(MILLISECONDS) : 1.105286 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.088614 DISJOIN(MILLISECONDS) : 0.452964 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.469022 ADD_EQUALITY(MILLISECONDS) : 0.017966 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010637 #CONJOIN_DISJUNCTIVE : 103 #RENAME_VARIABLES : 179 #UNFREEZE : 0 #CONJOIN : 175 #PROJECTAWAY : 136 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 346 LocStat_NO_SUPPORTING_DISEQUALITIES : 78 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 78 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.070472 RENAME_VARIABLES(MILLISECONDS) : 0.430118 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.022332 PROJECTAWAY(MILLISECONDS) : 0.965136 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068894 DISJOIN(MILLISECONDS) : 0.495967 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.460073 ADD_EQUALITY(MILLISECONDS) : 0.015981 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007937 #CONJOIN_DISJUNCTIVE : 103 #RENAME_VARIABLES : 179 #UNFREEZE : 0 #CONJOIN : 175 #PROJECTAWAY : 136 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 77 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 #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 #memory_int - 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 #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 #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 #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 #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 #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 #memory_int * 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: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-24 15:15:08,071 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,071 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,071 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,073 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,082 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,083 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,083 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,083 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,083 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,083 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,094 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,095 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:15:08,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 15:15:08,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.offset,QUANTIFIED] [2018-01-24 15:15:08,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~4.base,QUANTIFIED] [2018-01-24 15:15:08,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,099 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,100 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_5,QUANTIFIED] [2018-01-24 15:15:08,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,102 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,106 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,107 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,108 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,109 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,110 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:08,110 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((((((2 <= s2 && (\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1))) && 2 <= s1) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_5 + 1 <= s1) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] == 0)) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString2~4.offset_BEFORE_CALL_5 + 1 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2]) || !(\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= s2)) || !(1 == \valid[s2])) || !(\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~4.base][main_~nondetString2~4.offset + unknown-#length-unknown[main_~nondetString2~4.base] + -1] && !(main_~nondetString2~4.base == s1))) || !(\exists main_~length2~4 : int, v_main_~nondetString2~4.offset_BEFORE_CALL_3 : int :: ((unknown-#memory_int-unknown[s2][main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_3 + -1] == 0 && s2 <= v_main_~nondetString2~4.offset_BEFORE_CALL_3) && 1 <= main_~length2~4) && main_~length2~4 + v_main_~nondetString2~4.offset_BEFORE_CALL_3 <= unknown-#length-unknown[s2])) || !(\valid[s1] == 1)) || !(0 == s1)) || ((((((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= s1) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] == 0) && s2 == 0) && s1 == 0) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0)) && 1 == \valid[s2])) || (((((((((\exists main_~nondetString2~4.offset : int, main_~nondetString2~4.base : int :: unknown-#memory_int-unknown[main_~nondetString2~4.base][unknown-#length-unknown[main_~nondetString2~4.base] + main_~nondetString2~4.offset + -1] == 0 && !(main_~nondetString2~4.base == s1)) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_5 + 1 <= s1) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] == 0)) && (s1 + 2 <= unknown-#length-unknown[s1] || 1 == s1)) && (s2 + 2 <= unknown-#length-unknown[s2] || 1 == s2)) && (\exists v_main_~nondetString2~4.offset_BEFORE_CALL_5 : int :: ((v_main_~nondetString2~4.offset_BEFORE_CALL_5 <= 0 && v_main_~nondetString2~4.offset_BEFORE_CALL_5 + 1 <= s2) && 0 <= v_main_~nondetString2~4.offset_BEFORE_CALL_5) && unknown-#memory_int-unknown[s2][v_main_~nondetString2~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s2] + -1] == 0)) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2])) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0 && s1 <= v_main_~nondetString1~4.offset_BEFORE_CALL_2) && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[s1]) && 1 <= main_~length1~4)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_5 : int :: ((0 == unknown-#memory_int-unknown[s1][v_main_~nondetString1~4.offset_BEFORE_CALL_5 + unknown-#length-unknown[s1] + -1] && v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= 0) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_5) && v_main_~nondetString1~4.offset_BEFORE_CALL_5 <= s1)) || !(0 == s2)) && (((((((unknown-#length-unknown[s1] < 1 || !(0 == s1)) || !(1 == \valid[s2])) || !(0 == unknown-#memory_int-unknown[s1][s1])) || unknown-#length-unknown[s2] < 1) || !(\valid[s1] == 1)) || !(0 == s2)) || ((((((s2 == 0 && s1 == 0) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= unknown-#length-unknown[s2]) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[s2])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 50.2s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 21.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 1048 SDslu, 2488 SDs, 0 SdLazy, 2205 SolverSat, 128 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 472 SyntacticMatches, 18 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 3811 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 738 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1125 FormulaSimplificationTreeSizeReductionInter, 21.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1010 ConstructedInterpolants, 208 QuantifiedInterpolants, 693612 SizeOfPredicates, 136 NumberOfNonLiveVariables, 1308 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 47/256 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/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-15-08-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-15-08-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-15-08-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-15-08-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-15-08-115.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-15-08-115.csv Received shutdown request...