java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:54:01,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:54:01,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:54:01,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:54:01,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:54:01,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:54:01,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:54:01,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:54:01,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:54:01,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:54:01,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:54:01,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:54:01,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:54:01,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:54:01,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:54:01,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:54:01,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:54:01,206 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:54:01,208 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:54:01,209 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:54:01,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:54:01,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:54:01,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:54:01,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:54:01,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:54:01,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:54:01,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:54:01,215 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:54:01,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:54:01,216 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:54:01,216 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:54:01,217 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:54:01,226 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:54:01,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:54:01,227 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:54:01,228 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:54:01,228 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:54:01,228 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:54:01,228 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:54:01,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:54:01,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:54:01,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:54:01,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:54:01,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:54:01,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:54:01,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:54:01,230 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:54:01,230 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:54:01,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:54:01,231 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:54:01,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:54:01,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:54:01,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:54:01,232 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:54:01,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:54:01,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:54:01,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:54:01,232 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:54:01,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:54:01,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:54:01,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:54:01,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:54:01,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:54:01,234 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:54:01,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:54:01,235 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:54:01,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:54:01,283 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:54:01,287 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:54:01,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:54:01,289 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:54:01,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-01-24 11:54:01,581 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:54:01,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:54:01,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:54:01,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:54:01,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:54:01,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f990bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01, skipping insertion in model container [2018-01-24 11:54:01,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,620 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:54:01,675 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:54:01,811 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:54:01,839 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:54:01,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01 WrapperNode [2018-01-24 11:54:01,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:54:01,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:54:01,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:54:01,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:54:01,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... [2018-01-24 11:54:01,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:54:01,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:54:01,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:54:01,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:54:01,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:54:01,960 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:54:01,960 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:54:01,960 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-01-24 11:54:01,960 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-01-24 11:54:01,961 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:54:01,961 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:54:01,961 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 11:54:01,962 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 11:54:01,962 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-01-24 11:54:01,963 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-01-24 11:54:01,964 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-01-24 11:54:01,964 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-01-24 11:54:01,964 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-01-24 11:54:01,964 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:54:01,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:54:01,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:54:02,199 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 11:54:02,572 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:54:02,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:54:02 BoogieIcfgContainer [2018-01-24 11:54:02,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:54:02,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:54:02,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:54:02,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:54:02,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:54:01" (1/3) ... [2018-01-24 11:54:02,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ac51b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:54:02, skipping insertion in model container [2018-01-24 11:54:02,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:01" (2/3) ... [2018-01-24 11:54:02,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ac51b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:54:02, skipping insertion in model container [2018-01-24 11:54:02,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:54:02" (3/3) ... [2018-01-24 11:54:02,579 INFO L105 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-01-24 11:54:02,586 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:54:02,594 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 11:54:02,636 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:54:02,637 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:54:02,637 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:54:02,637 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:54:02,637 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:54:02,637 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:54:02,637 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:54:02,638 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:54:02,638 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:54:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-01-24 11:54:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:54:02,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:02,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:02,667 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-01-24 11:54:02,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:02,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:02,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:02,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:02,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:02,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:02,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:02,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:54:02,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:54:03,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:54:03,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:54:03,017 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-01-24 11:54:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:03,483 INFO L93 Difference]: Finished difference Result 368 states and 442 transitions. [2018-01-24 11:54:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:54:03,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:54:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:03,500 INFO L225 Difference]: With dead ends: 368 [2018-01-24 11:54:03,501 INFO L226 Difference]: Without dead ends: 202 [2018-01-24 11:54:03,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-24 11:54:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-01-24 11:54:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-24 11:54:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-01-24 11:54:03,568 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-01-24 11:54:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:03,568 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-01-24 11:54:03,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:54:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-01-24 11:54:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:54:03,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:03,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:03,570 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:03,570 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-01-24 11:54:03,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:03,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:03,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:03,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:03,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:03,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:03,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:03,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:54:03,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:54:03,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:54:03,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:54:03,703 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-01-24 11:54:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:03,949 INFO L93 Difference]: Finished difference Result 209 states and 250 transitions. [2018-01-24 11:54:03,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:54:03,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:54:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:03,954 INFO L225 Difference]: With dead ends: 209 [2018-01-24 11:54:03,954 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 11:54:03,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 11:54:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-24 11:54:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-24 11:54:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-01-24 11:54:03,980 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-01-24 11:54:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:03,980 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-01-24 11:54:03,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:54:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-01-24 11:54:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:54:03,981 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:03,981 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:03,981 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-01-24 11:54:03,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:03,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:03,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:03,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:03,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:04,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:04,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:04,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:54:04,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:54:04,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:54:04,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:04,104 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-01-24 11:54:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:04,297 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-01-24 11:54:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:54:04,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 11:54:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:04,299 INFO L225 Difference]: With dead ends: 206 [2018-01-24 11:54:04,300 INFO L226 Difference]: Without dead ends: 202 [2018-01-24 11:54:04,300 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:54:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-24 11:54:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-01-24 11:54:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 11:54:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-01-24 11:54:04,318 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-01-24 11:54:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:04,319 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-01-24 11:54:04,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:54:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-01-24 11:54:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:54:04,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:04,320 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:04,320 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-01-24 11:54:04,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:04,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:04,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:04,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:04,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:04,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:04,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:04,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:54:04,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:54:04,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:54:04,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:04,375 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-01-24 11:54:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:04,686 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-01-24 11:54:04,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:54:04,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 11:54:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:04,689 INFO L225 Difference]: With dead ends: 202 [2018-01-24 11:54:04,689 INFO L226 Difference]: Without dead ends: 201 [2018-01-24 11:54:04,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:54:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-24 11:54:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-01-24 11:54:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-24 11:54:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-01-24 11:54:04,706 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-01-24 11:54:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:04,706 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-01-24 11:54:04,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:54:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-01-24 11:54:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:54:04,707 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:04,707 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:04,707 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-01-24 11:54:04,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:04,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:04,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:04,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:04,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:04,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:04,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:04,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:54:04,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:54:04,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:54:04,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:04,834 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-01-24 11:54:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:05,037 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-01-24 11:54:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:54:05,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 11:54:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:05,041 INFO L225 Difference]: With dead ends: 201 [2018-01-24 11:54:05,041 INFO L226 Difference]: Without dead ends: 200 [2018-01-24 11:54:05,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:54:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-24 11:54:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-01-24 11:54:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 11:54:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-01-24 11:54:05,064 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-01-24 11:54:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:05,065 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-01-24 11:54:05,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:54:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-01-24 11:54:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:54:05,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:05,066 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:05,066 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-01-24 11:54:05,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:05,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:05,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:05,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:05,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:05,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:05,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:05,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:54:05,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:54:05,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:54:05,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:05,136 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-01-24 11:54:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:05,209 INFO L93 Difference]: Finished difference Result 395 states and 472 transitions. [2018-01-24 11:54:05,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:54:05,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 11:54:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:05,212 INFO L225 Difference]: With dead ends: 395 [2018-01-24 11:54:05,212 INFO L226 Difference]: Without dead ends: 210 [2018-01-24 11:54:05,214 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:54:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-24 11:54:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-01-24 11:54:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-24 11:54:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-01-24 11:54:05,227 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-01-24 11:54:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:05,228 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-01-24 11:54:05,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:54:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-01-24 11:54:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:54:05,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:05,229 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:05,229 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-01-24 11:54:05,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:05,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:05,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:05,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:05,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:05,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:05,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:05,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:54:05,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:54:05,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:54:05,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:54:05,412 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-01-24 11:54:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:05,984 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-01-24 11:54:05,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:54:05,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 11:54:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:05,986 INFO L225 Difference]: With dead ends: 210 [2018-01-24 11:54:05,986 INFO L226 Difference]: Without dead ends: 208 [2018-01-24 11:54:05,986 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:54:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-24 11:54:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-01-24 11:54:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-24 11:54:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-01-24 11:54:05,998 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-01-24 11:54:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:05,999 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-01-24 11:54:05,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:54:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-01-24 11:54:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:54:06,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:06,000 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:06,000 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-01-24 11:54:06,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:06,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:06,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:06,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:06,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:06,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:06,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:06,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:54:06,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:54:06,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:54:06,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:54:06,300 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-01-24 11:54:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:06,606 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-01-24 11:54:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:54:06,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 11:54:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:06,608 INFO L225 Difference]: With dead ends: 208 [2018-01-24 11:54:06,608 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 11:54:06,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:54:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 11:54:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-01-24 11:54:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 11:54:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-01-24 11:54:06,618 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-01-24 11:54:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:06,618 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-01-24 11:54:06,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:54:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-01-24 11:54:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 11:54:06,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:06,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:06,619 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-01-24 11:54:06,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:06,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:06,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:06,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:06,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:06,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:06,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:06,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:54:06,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:54:06,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:54:06,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:54:06,846 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-01-24 11:54:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:07,039 INFO L93 Difference]: Finished difference Result 411 states and 498 transitions. [2018-01-24 11:54:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:54:07,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-24 11:54:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:07,041 INFO L225 Difference]: With dead ends: 411 [2018-01-24 11:54:07,042 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 11:54:07,042 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:54:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 11:54:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-01-24 11:54:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-24 11:54:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-01-24 11:54:07,054 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-01-24 11:54:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:07,054 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-01-24 11:54:07,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:54:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-01-24 11:54:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:54:07,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:07,056 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:07,056 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:07,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-01-24 11:54:07,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:07,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:07,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:07,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:07,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:07,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:07,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:07,228 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:07,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:07,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:07,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:07,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-01-24 11:54:07,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:54:07,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:54:07,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:54:07,409 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 11 states. [2018-01-24 11:54:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:07,679 INFO L93 Difference]: Finished difference Result 435 states and 532 transitions. [2018-01-24 11:54:07,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:54:07,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-01-24 11:54:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:07,682 INFO L225 Difference]: With dead ends: 435 [2018-01-24 11:54:07,682 INFO L226 Difference]: Without dead ends: 229 [2018-01-24 11:54:07,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:54:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-24 11:54:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2018-01-24 11:54:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 11:54:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-01-24 11:54:07,699 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 34 [2018-01-24 11:54:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:07,700 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-01-24 11:54:07,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:54:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-01-24 11:54:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 11:54:07,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:07,701 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:07,701 INFO L371 AbstractCegarLoop]: === Iteration 11 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-01-24 11:54:07,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:07,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:07,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:07,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:07,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:07,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:07,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:07,924 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:07,939 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:54:07,971 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:07,992 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:07,994 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:07,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:08,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:08,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-01-24 11:54:08,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:54:08,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:54:08,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:54:08,251 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 12 states. [2018-01-24 11:54:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:08,522 INFO L93 Difference]: Finished difference Result 439 states and 528 transitions. [2018-01-24 11:54:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:54:08,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-01-24 11:54:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:08,525 INFO L225 Difference]: With dead ends: 439 [2018-01-24 11:54:08,525 INFO L226 Difference]: Without dead ends: 227 [2018-01-24 11:54:08,526 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:54:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-24 11:54:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-01-24 11:54:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-24 11:54:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2018-01-24 11:54:08,541 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 35 [2018-01-24 11:54:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:08,541 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2018-01-24 11:54:08,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:54:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2018-01-24 11:54:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:54:08,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:08,543 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:08,543 INFO L371 AbstractCegarLoop]: === Iteration 12 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-01-24 11:54:08,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:08,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:08,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:08,544 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:08,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:08,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:08,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:08,945 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:08,952 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:54:08,974 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:54:08,987 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:54:09,012 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:54:09,013 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:09,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:09,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:09,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-01-24 11:54:09,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:54:09,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:54:09,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:54:09,071 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand 13 states. [2018-01-24 11:54:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:09,324 INFO L93 Difference]: Finished difference Result 443 states and 534 transitions. [2018-01-24 11:54:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:54:09,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-24 11:54:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:09,327 INFO L225 Difference]: With dead ends: 443 [2018-01-24 11:54:09,327 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 11:54:09,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:54:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 11:54:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-01-24 11:54:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 11:54:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-01-24 11:54:09,342 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2018-01-24 11:54:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:09,342 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-01-24 11:54:09,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:54:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-01-24 11:54:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 11:54:09,343 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:09,343 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:09,344 INFO L371 AbstractCegarLoop]: === Iteration 13 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-01-24 11:54:09,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:09,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:09,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:09,345 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:09,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:09,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:09,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:09,504 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:09,513 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 11:54:09,547 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:09,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:09,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:09,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-01-24 11:54:09,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:54:09,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:54:09,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:54:09,632 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2018-01-24 11:54:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:10,122 INFO L93 Difference]: Finished difference Result 447 states and 540 transitions. [2018-01-24 11:54:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:54:10,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-01-24 11:54:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:10,125 INFO L225 Difference]: With dead ends: 447 [2018-01-24 11:54:10,126 INFO L226 Difference]: Without dead ends: 233 [2018-01-24 11:54:10,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:54:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-24 11:54:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-01-24 11:54:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-24 11:54:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2018-01-24 11:54:10,136 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 37 [2018-01-24 11:54:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:10,137 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2018-01-24 11:54:10,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:54:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2018-01-24 11:54:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:54:10,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:10,138 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:10,138 INFO L371 AbstractCegarLoop]: === Iteration 14 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:10,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-01-24 11:54:10,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:10,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:10,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:10,139 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:10,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:10,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:10,979 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 12 DAG size of output 7 [2018-01-24 11:54:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:10,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:10,997 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:11,003 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 11:54:11,012 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:11,015 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:11,019 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:11,040 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:11,043 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:11,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:11,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:11,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-01-24 11:54:11,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:54:11,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:54:11,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:54:11,144 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand 15 states. [2018-01-24 11:54:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:11,599 INFO L93 Difference]: Finished difference Result 451 states and 546 transitions. [2018-01-24 11:54:11,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:54:11,600 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-01-24 11:54:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:11,602 INFO L225 Difference]: With dead ends: 451 [2018-01-24 11:54:11,602 INFO L226 Difference]: Without dead ends: 236 [2018-01-24 11:54:11,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:54:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-24 11:54:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-01-24 11:54:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 11:54:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-01-24 11:54:11,615 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 38 [2018-01-24 11:54:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:11,615 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-01-24 11:54:11,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:54:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-01-24 11:54:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 11:54:11,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:11,618 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:11,618 INFO L371 AbstractCegarLoop]: === Iteration 15 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-01-24 11:54:11,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:11,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:11,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:11,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:11,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:11,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:11,791 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 11:54:11,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:11,792 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:11,801 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 11:54:11,821 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:54:11,841 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:54:11,860 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:54:12,011 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:54:12,012 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:12,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:12,064 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 11:54:12,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:12,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-01-24 11:54:12,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:54:12,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:54:12,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:54:12,100 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 16 states. [2018-01-24 11:54:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:12,760 INFO L93 Difference]: Finished difference Result 455 states and 552 transitions. [2018-01-24 11:54:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:54:12,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-01-24 11:54:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:12,763 INFO L225 Difference]: With dead ends: 455 [2018-01-24 11:54:12,763 INFO L226 Difference]: Without dead ends: 239 [2018-01-24 11:54:12,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-01-24 11:54:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-24 11:54:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-01-24 11:54:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-24 11:54:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-01-24 11:54:12,781 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 39 [2018-01-24 11:54:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:12,781 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-01-24 11:54:12,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:54:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-01-24 11:54:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:54:12,782 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:12,782 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:12,783 INFO L371 AbstractCegarLoop]: === Iteration 16 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-01-24 11:54:12,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:12,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:12,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:12,784 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:12,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:12,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:13,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:13,740 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:13,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:13,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:13,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:13,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-01-24 11:54:13,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:54:13,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:54:13,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:54:13,971 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 17 states. [2018-01-24 11:54:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:14,455 INFO L93 Difference]: Finished difference Result 459 states and 558 transitions. [2018-01-24 11:54:14,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 11:54:14,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-01-24 11:54:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:14,457 INFO L225 Difference]: With dead ends: 459 [2018-01-24 11:54:14,457 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 11:54:14,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:54:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 11:54:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-01-24 11:54:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-24 11:54:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2018-01-24 11:54:14,472 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 40 [2018-01-24 11:54:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:14,472 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2018-01-24 11:54:14,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:54:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-01-24 11:54:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:54:14,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:14,473 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:14,473 INFO L371 AbstractCegarLoop]: === Iteration 17 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-01-24 11:54:14,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:14,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:14,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:14,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:14,751 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 10 DAG size of output 9 [2018-01-24 11:54:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 11:54:15,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:15,388 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:15,393 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:54:15,410 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:15,425 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:15,427 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:15,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:15,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:54:15,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:54:15,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:15,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:15,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 11:54:15,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-24 11:54:15,536 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 13 treesize of output 10 [2018-01-24 11:54:15,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 11:54:15,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:15,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-24 11:54:15,600 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 18 treesize of output 14 [2018-01-24 11:54:15,603 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 14 treesize of output 10 [2018-01-24 11:54:15,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:15,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:15,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:15,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 11:54:16,471 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-01-24 11:54:16,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-01-24 11:54:16,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-01-24 11:54:16,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-01-24 11:54:16,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-01-24 11:54:16,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-01-24 11:54:16,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-01-24 11:54:16,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-01-24 11:54:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-01-24 11:54:16,726 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,755 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,796 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:16,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:17,000 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:104, output treesize:164 [2018-01-24 11:54:17,142 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 109 [2018-01-24 11:54:17,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:17,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 148 [2018-01-24 11:54:17,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:17,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:150 [2018-01-24 11:54:17,278 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 113 [2018-01-24 11:54:17,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:17,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 150 [2018-01-24 11:54:17,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:17,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:169, output treesize:150 [2018-01-24 11:54:17,666 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 129 treesize of output 75 [2018-01-24 11:54:17,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-24 11:54:17,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-01-24 11:54:17,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:17,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:17,736 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:134, output treesize:15 [2018-01-24 11:54:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 28 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:54:17,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:17,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2018-01-24 11:54:17,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 11:54:17,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 11:54:17,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=835, Unknown=255, NotChecked=0, Total=1190 [2018-01-24 11:54:17,822 INFO L87 Difference]: Start difference. First operand 222 states and 270 transitions. Second operand 35 states. [2018-01-24 11:54:19,741 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 58 DAG size of output 51 [2018-01-24 11:54:25,864 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 58 DAG size of output 51 [2018-01-24 11:54:29,969 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 60 DAG size of output 53 [2018-01-24 11:54:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:34,400 INFO L93 Difference]: Finished difference Result 270 states and 332 transitions. [2018-01-24 11:54:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-24 11:54:34,401 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2018-01-24 11:54:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:34,402 INFO L225 Difference]: With dead ends: 270 [2018-01-24 11:54:34,402 INFO L226 Difference]: Without dead ends: 269 [2018-01-24 11:54:34,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=311, Invalid=2682, Unknown=547, NotChecked=0, Total=3540 [2018-01-24 11:54:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-24 11:54:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2018-01-24 11:54:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-24 11:54:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 269 transitions. [2018-01-24 11:54:34,433 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 269 transitions. Word has length 41 [2018-01-24 11:54:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:34,433 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 269 transitions. [2018-01-24 11:54:34,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 11:54:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 269 transitions. [2018-01-24 11:54:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:54:34,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:34,434 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:34,434 INFO L371 AbstractCegarLoop]: === Iteration 18 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288045, now seen corresponding path program 1 times [2018-01-24 11:54:34,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:34,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:34,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:34,435 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:34,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:34,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 11:54:34,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:34,970 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:34,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:35,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:35,072 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 10 treesize of output 9 [2018-01-24 11:54:35,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:35,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:35,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:54:35,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:35,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-01-24 11:54:35,110 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 13 treesize of output 10 [2018-01-24 11:54:35,112 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 10 treesize of output 9 [2018-01-24 11:54:35,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,123 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 13 treesize of output 10 [2018-01-24 11:54:35,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 11:54:35,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:35,133 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-01-24 11:54:35,187 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 9 treesize of output 7 [2018-01-24 11:54:35,189 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 7 treesize of output 1 [2018-01-24 11:54:35,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-01-24 11:54:35,198 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 22 treesize of output 14 [2018-01-24 11:54:35,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:35,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:35,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:35,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-01-24 11:54:35,237 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |c_#Ultimate.C_memset_#value| 256)))))))) is different from true [2018-01-24 11:54:35,249 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse2 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse2) .cse1 .cse2))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,256 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse3 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse3) .cse1 .cse3) .cse2 .cse3))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,265 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse4 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse4) .cse1 .cse4) .cse2 .cse4) .cse3 .cse4))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,277 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse5 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse5) .cse1 .cse5) .cse2 .cse5) .cse3 .cse5) .cse4 .cse5))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,286 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse6 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse6) .cse1 .cse6) .cse2 .cse6) .cse3 .cse6) .cse4 .cse6) .cse5 .cse6))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,296 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_47| Int) (|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_47| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,307 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_48| Int) (|v_#Ultimate.C_memset_#t~loopctr54_47| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse3 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse4 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse6 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_47| |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |v_#Ultimate.C_memset_#t~loopctr54_48| |#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-24 11:54:35,364 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2018-01-24 11:54:35,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-01-24 11:54:35,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-01-24 11:54:35,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-01-24 11:54:35,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-01-24 11:54:35,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-01-24 11:54:35,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-01-24 11:54:35,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-01-24 11:54:35,836 INFO L303 Elim1Store]: Index analysis took 133 ms [2018-01-24 11:54:35,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-01-24 11:54:35,838 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,890 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,937 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:35,992 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,085 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,357 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 86 treesize of output 87 [2018-01-24 11:54:36,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-01-24 11:54:36,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-01-24 11:54:36,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 74 [2018-01-24 11:54:36,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2018-01-24 11:54:36,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-01-24 11:54:36,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-01-24 11:54:36,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-01-24 11:54:36,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 137 [2018-01-24 11:54:36,488 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,510 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,529 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,551 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,571 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,591 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,611 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,631 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,657 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:36,712 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:183, output treesize:303 [2018-01-24 11:54:36,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 233 [2018-01-24 11:54:36,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:36,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 288 [2018-01-24 11:54:36,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,941 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 161 treesize of output 166 [2018-01-24 11:54:36,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:36,947 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 20 treesize of output 16 [2018-01-24 11:54:36,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:36,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:37,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:38,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:324, output treesize:294 [2018-01-24 11:54:38,190 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 165 treesize of output 170 [2018-01-24 11:54:38,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:38,202 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 24 treesize of output 18 [2018-01-24 11:54:38,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:38,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:38,353 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 237 [2018-01-24 11:54:38,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:54:38,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 290 [2018-01-24 11:54:38,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:38,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:38,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:38,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:332, output treesize:294 [2018-01-24 11:54:38,916 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 291 treesize of output 205 [2018-01-24 11:54:38,921 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 149 treesize of output 102 [2018-01-24 11:54:38,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:38,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-01-24 11:54:38,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:39,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:39,059 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 107 treesize of output 91 [2018-01-24 11:54:39,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 1 [2018-01-24 11:54:39,099 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:39,105 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 3 [2018-01-24 11:54:39,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 11:54:39,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:54:39,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:54:39,113 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:312, output treesize:16 [2018-01-24 11:54:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-01-24 11:54:39,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:39,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2018-01-24 11:54:39,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 11:54:39,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 11:54:39,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=687, Unknown=8, NotChecked=472, Total=1260 [2018-01-24 11:54:39,190 INFO L87 Difference]: Start difference. First operand 221 states and 269 transitions. Second operand 36 states. [2018-01-24 11:54:42,093 WARN L146 SmtUtils]: Spent 1345ms on a formula simplification. DAG size of input: 66 DAG size of output 52 [2018-01-24 11:54:43,415 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 106 DAG size of output 97 [2018-01-24 11:54:43,712 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 166 DAG size of output 148 [2018-01-24 11:54:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:47,578 INFO L93 Difference]: Finished difference Result 252 states and 311 transitions. [2018-01-24 11:54:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 11:54:47,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-01-24 11:54:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:47,580 INFO L225 Difference]: With dead ends: 252 [2018-01-24 11:54:47,581 INFO L226 Difference]: Without dead ends: 251 [2018-01-24 11:54:47,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=316, Invalid=2356, Unknown=116, NotChecked=872, Total=3660 [2018-01-24 11:54:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-24 11:54:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2018-01-24 11:54:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 11:54:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 268 transitions. [2018-01-24 11:54:47,610 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 268 transitions. Word has length 41 [2018-01-24 11:54:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:47,610 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 268 transitions. [2018-01-24 11:54:47,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 11:54:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 268 transitions. [2018-01-24 11:54:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-24 11:54:47,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:47,611 INFO L322 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:47,612 INFO L371 AbstractCegarLoop]: === Iteration 19 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116567, now seen corresponding path program 1 times [2018-01-24 11:54:47,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:47,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:47,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:47,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:47,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:47,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-01-24 11:54:47,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:47,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:54:47,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:54:47,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:54:47,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:54:47,718 INFO L87 Difference]: Start difference. First operand 220 states and 268 transitions. Second operand 6 states. [2018-01-24 11:54:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:48,016 INFO L93 Difference]: Finished difference Result 220 states and 268 transitions. [2018-01-24 11:54:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:54:48,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-01-24 11:54:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:48,019 INFO L225 Difference]: With dead ends: 220 [2018-01-24 11:54:48,019 INFO L226 Difference]: Without dead ends: 218 [2018-01-24 11:54:48,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:54:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-24 11:54:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-01-24 11:54:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 11:54:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 266 transitions. [2018-01-24 11:54:48,043 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 266 transitions. Word has length 74 [2018-01-24 11:54:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:48,044 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 266 transitions. [2018-01-24 11:54:48,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:54:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2018-01-24 11:54:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-24 11:54:48,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:48,045 INFO L322 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:48,045 INFO L371 AbstractCegarLoop]: === Iteration 20 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116568, now seen corresponding path program 1 times [2018-01-24 11:54:48,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:48,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:48,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:48,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:48,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:48,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-24 11:54:48,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:54:48,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:54:48,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:54:48,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:54:48,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:54:48,193 INFO L87 Difference]: Start difference. First operand 218 states and 266 transitions. Second operand 8 states. [2018-01-24 11:54:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:48,350 INFO L93 Difference]: Finished difference Result 218 states and 266 transitions. [2018-01-24 11:54:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:54:48,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-01-24 11:54:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:48,352 INFO L225 Difference]: With dead ends: 218 [2018-01-24 11:54:48,353 INFO L226 Difference]: Without dead ends: 216 [2018-01-24 11:54:48,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:54:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-01-24 11:54:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-01-24 11:54:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 11:54:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2018-01-24 11:54:48,376 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 74 [2018-01-24 11:54:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:48,377 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2018-01-24 11:54:48,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:54:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2018-01-24 11:54:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-24 11:54:48,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:48,378 INFO L322 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:48,378 INFO L371 AbstractCegarLoop]: === Iteration 21 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1541875248, now seen corresponding path program 1 times [2018-01-24 11:54:48,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:48,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:48,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:48,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:48,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:48,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:54:48,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:48,569 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:48,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:48,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:54:48,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:48,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-24 11:54:48,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:54:48,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:54:48,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:54:48,666 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand 15 states. [2018-01-24 11:54:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:48,889 INFO L93 Difference]: Finished difference Result 439 states and 548 transitions. [2018-01-24 11:54:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:54:48,890 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-01-24 11:54:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:48,893 INFO L225 Difference]: With dead ends: 439 [2018-01-24 11:54:48,893 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 11:54:48,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2018-01-24 11:54:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 11:54:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 228. [2018-01-24 11:54:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-24 11:54:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 281 transitions. [2018-01-24 11:54:48,943 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 281 transitions. Word has length 75 [2018-01-24 11:54:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:48,943 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 281 transitions. [2018-01-24 11:54:48,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:54:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 281 transitions. [2018-01-24 11:54:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-24 11:54:48,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:48,944 INFO L322 BasicCegarLoop]: trace histogram [17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:48,945 INFO L371 AbstractCegarLoop]: === Iteration 22 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash 889551470, now seen corresponding path program 2 times [2018-01-24 11:54:48,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:48,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:48,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:48,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:54:48,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:48,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:54:49,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:49,163 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:49,168 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:54:49,191 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:49,216 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:54:49,220 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:54:49,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:54:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:54:49,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:54:49,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-24 11:54:49,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 11:54:49,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 11:54:49,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:54:49,281 INFO L87 Difference]: Start difference. First operand 228 states and 281 transitions. Second operand 16 states. [2018-01-24 11:54:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:54:49,547 INFO L93 Difference]: Finished difference Result 445 states and 557 transitions. [2018-01-24 11:54:49,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:54:49,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-01-24 11:54:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:54:49,552 INFO L225 Difference]: With dead ends: 445 [2018-01-24 11:54:49,552 INFO L226 Difference]: Without dead ends: 251 [2018-01-24 11:54:49,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:54:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-24 11:54:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-01-24 11:54:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-24 11:54:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2018-01-24 11:54:49,585 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 76 [2018-01-24 11:54:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:54:49,585 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-01-24 11:54:49,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 11:54:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2018-01-24 11:54:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-24 11:54:49,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:54:49,586 INFO L322 BasicCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:54:49,586 INFO L371 AbstractCegarLoop]: === Iteration 23 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 11:54:49,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2142350832, now seen corresponding path program 3 times [2018-01-24 11:54:49,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:54:49,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:54:49,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:49,588 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:54:49,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:54:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:54:49,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:54:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:54:49,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:54:49,935 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:54:49,940 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:54:49,968 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:54:49,994 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:54:50,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:54:52,358 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown