java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:27:49,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:27:49,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:27:49,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:27:49,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:27:49,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:27:49,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:27:49,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:27:49,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:27:49,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:27:49,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:27:49,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:27:49,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:27:49,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:27:49,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:27:49,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:27:49,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:27:49,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:27:49,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:27:49,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:27:49,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:27:49,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:27:49,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:27:49,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:27:49,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:27:49,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:27:49,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:27:49,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:27:49,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:27:49,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:27:49,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:27:49,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:27:49,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:27:49,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:27:49,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:27:49,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:27:49,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:27:49,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:27:49,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:27:49,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:27:49,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:27:49,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:27:49,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:27:49,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:27:49,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:27:49,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:27:49,189 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:27:49,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:27:49,189 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:27:49,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:27:49,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:27:49,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:27:49,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:27:49,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:27:49,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:27:49,190 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:27:49,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:27:49,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:27:49,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:27:49,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:27:49,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:27:49,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:27:49,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:27:49,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:27:49,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:27:49,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:27:49,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:27:49,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:27:49,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:27:49,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:27:49,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:27:49,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:27:49,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:27:49,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:27:49,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:27:49,244 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:27:49,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c [2019-10-02 12:27:49,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d444a6ca4/17326b38594a4a09b2523b2a5436eda1/FLAG865cd8e1a [2019-10-02 12:27:49,904 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:27:49,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product18.cil.c [2019-10-02 12:27:49,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d444a6ca4/17326b38594a4a09b2523b2a5436eda1/FLAG865cd8e1a [2019-10-02 12:27:50,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d444a6ca4/17326b38594a4a09b2523b2a5436eda1 [2019-10-02 12:27:50,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:27:50,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:27:50,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:27:50,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:27:50,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:27:50,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:27:50" (1/1) ... [2019-10-02 12:27:50,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620d03a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:50, skipping insertion in model container [2019-10-02 12:27:50,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:27:50" (1/1) ... [2019-10-02 12:27:50,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:27:50,229 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:27:50,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:27:50,878 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:27:51,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:27:51,125 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:27:51,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51 WrapperNode [2019-10-02 12:27:51,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:27:51,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:27:51,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:27:51,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:27:51,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... [2019-10-02 12:27:51,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:27:51,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:27:51,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:27:51,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:27:51,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-02 12:27:51,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:27:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:27:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:27:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:27:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:27:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:27:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:27:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:27:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:27:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:27:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:27:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:27:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:27:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:27:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:27:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:27:51,453 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:27:51,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:27:51,454 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:27:51,454 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:27:51,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:27:51,455 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:27:51,455 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:27:51,455 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:27:51,455 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:27:51,455 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:27:51,456 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:27:51,456 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:27:51,456 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:27:51,456 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:27:51,456 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:27:51,457 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:27:51,457 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:27:51,457 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:27:51,457 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:27:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:27:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:27:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:27:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:27:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:27:51,459 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:27:51,459 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:27:51,459 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:27:51,459 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:27:51,460 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:27:51,460 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:27:51,460 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:27:51,460 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:27:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:27:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:27:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:27:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:27:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-10-02 12:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-10-02 12:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:27:51,464 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:27:51,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:27:51,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:27:51,465 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:27:51,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:27:51,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:27:51,465 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:27:51,465 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:27:51,466 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:27:51,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:27:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:27:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:27:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:27:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:27:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:27:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:27:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:27:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:27:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:27:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:27:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:27:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:27:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:27:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:27:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:27:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:27:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:27:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:27:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:27:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:27:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:27:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:27:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:27:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:27:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:27:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:27:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:27:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:27:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:27:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:27:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:27:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:27:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:27:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:27:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:27:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:27:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:27:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:27:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:27:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:27:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:27:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:27:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:27:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:27:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:27:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:27:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:27:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:27:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:27:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:27:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:27:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:27:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:27:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:27:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:27:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:27:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:27:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:27:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:27:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:27:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:27:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:27:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:27:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:27:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:27:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:27:51,486 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:27:51,486 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:27:51,486 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:27:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:27:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:27:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:27:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:27:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:27:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:27:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:27:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:27:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:27:51,492 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:27:51,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:27:51,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:27:51,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:27:53,641 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:27:53,642 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:27:53,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:27:53 BoogieIcfgContainer [2019-10-02 12:27:53,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:27:53,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:27:53,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:27:53,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:27:53,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:27:50" (1/3) ... [2019-10-02 12:27:53,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1118f501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:27:53, skipping insertion in model container [2019-10-02 12:27:53,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:27:51" (2/3) ... [2019-10-02 12:27:53,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1118f501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:27:53, skipping insertion in model container [2019-10-02 12:27:53,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:27:53" (3/3) ... [2019-10-02 12:27:53,654 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product18.cil.c [2019-10-02 12:27:53,664 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:27:53,676 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:27:53,695 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:27:53,745 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:27:53,746 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:27:53,746 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:27:53,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:27:53,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:27:53,747 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:27:53,747 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:27:53,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:27:53,747 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:27:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states. [2019-10-02 12:27:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:27:53,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:53,820 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:53,823 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1366421017, now seen corresponding path program 1 times [2019-10-02 12:27:53,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:53,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:54,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:54,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:27:54,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:27:54,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:27:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:27:54,603 INFO L87 Difference]: Start difference. First operand 781 states. Second operand 7 states. [2019-10-02 12:27:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:54,955 INFO L93 Difference]: Finished difference Result 1227 states and 1992 transitions. [2019-10-02 12:27:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:27:54,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-02 12:27:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:54,988 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:27:54,989 INFO L226 Difference]: Without dead ends: 622 [2019-10-02 12:27:55,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-02 12:27:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-02 12:27:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:27:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 991 transitions. [2019-10-02 12:27:55,112 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 991 transitions. Word has length 93 [2019-10-02 12:27:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:55,112 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 991 transitions. [2019-10-02 12:27:55,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:27:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 991 transitions. [2019-10-02 12:27:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:27:55,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:55,118 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:55,118 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1643390832, now seen corresponding path program 1 times [2019-10-02 12:27:55,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:55,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:55,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:55,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:27:55,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:27:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:27:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:27:55,344 INFO L87 Difference]: Start difference. First operand 620 states and 991 transitions. Second operand 4 states. [2019-10-02 12:27:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:55,411 INFO L93 Difference]: Finished difference Result 1206 states and 1947 transitions. [2019-10-02 12:27:55,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:27:55,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 12:27:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:55,420 INFO L225 Difference]: With dead ends: 1206 [2019-10-02 12:27:55,421 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:27:55,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:27:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:27:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:27:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:27:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 958 transitions. [2019-10-02 12:27:55,474 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 958 transitions. Word has length 94 [2019-10-02 12:27:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:55,476 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 958 transitions. [2019-10-02 12:27:55,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:27:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 958 transitions. [2019-10-02 12:27:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:27:55,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:55,480 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:55,480 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1305237044, now seen corresponding path program 1 times [2019-10-02 12:27:55,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:55,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:55,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:55,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:55,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:55,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:27:55,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:27:55,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:27:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:27:55,697 INFO L87 Difference]: Start difference. First operand 602 states and 958 transitions. Second operand 7 states. [2019-10-02 12:27:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:55,799 INFO L93 Difference]: Finished difference Result 1175 states and 1889 transitions. [2019-10-02 12:27:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:27:55,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-02 12:27:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:55,806 INFO L225 Difference]: With dead ends: 1175 [2019-10-02 12:27:55,806 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:27:55,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:27:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:27:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:27:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 945 transitions. [2019-10-02 12:27:55,885 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 945 transitions. Word has length 94 [2019-10-02 12:27:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:55,885 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 945 transitions. [2019-10-02 12:27:55,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:27:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 945 transitions. [2019-10-02 12:27:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:27:55,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:55,887 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:55,888 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1548689565, now seen corresponding path program 1 times [2019-10-02 12:27:55,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:55,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:56,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:27:56,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:27:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:27:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:27:56,044 INFO L87 Difference]: Start difference. First operand 596 states and 945 transitions. Second operand 7 states. [2019-10-02 12:27:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:56,139 INFO L93 Difference]: Finished difference Result 1163 states and 1863 transitions. [2019-10-02 12:27:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:27:56,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:27:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:56,146 INFO L225 Difference]: With dead ends: 1163 [2019-10-02 12:27:56,146 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:27:56,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:27:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:27:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:27:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 932 transitions. [2019-10-02 12:27:56,177 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 932 transitions. Word has length 95 [2019-10-02 12:27:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:56,177 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 932 transitions. [2019-10-02 12:27:56,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:27:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 932 transitions. [2019-10-02 12:27:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:27:56,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:56,181 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:56,182 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1649028488, now seen corresponding path program 1 times [2019-10-02 12:27:56,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:56,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:56,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:56,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:56,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:56,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:56,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:27:56,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:27:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:27:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:27:56,352 INFO L87 Difference]: Start difference. First operand 590 states and 932 transitions. Second operand 7 states. [2019-10-02 12:27:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:56,481 INFO L93 Difference]: Finished difference Result 1151 states and 1837 transitions. [2019-10-02 12:27:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:27:56,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-02 12:27:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:56,489 INFO L225 Difference]: With dead ends: 1151 [2019-10-02 12:27:56,489 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:56,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 919 transitions. [2019-10-02 12:27:56,518 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 919 transitions. Word has length 96 [2019-10-02 12:27:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:56,520 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 919 transitions. [2019-10-02 12:27:56,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:27:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 919 transitions. [2019-10-02 12:27:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:27:56,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:56,522 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:56,522 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash -260086663, now seen corresponding path program 1 times [2019-10-02 12:27:56,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:56,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:56,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:56,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:56,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:56,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:27:56,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:27:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:27:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:27:56,698 INFO L87 Difference]: Start difference. First operand 584 states and 919 transitions. Second operand 7 states. [2019-10-02 12:27:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:56,791 INFO L93 Difference]: Finished difference Result 1139 states and 1811 transitions. [2019-10-02 12:27:56,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:27:56,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-02 12:27:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:56,798 INFO L225 Difference]: With dead ends: 1139 [2019-10-02 12:27:56,798 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:56,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 918 transitions. [2019-10-02 12:27:56,829 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 918 transitions. Word has length 96 [2019-10-02 12:27:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:56,830 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 918 transitions. [2019-10-02 12:27:56,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:27:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 918 transitions. [2019-10-02 12:27:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:27:56,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:56,833 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:56,833 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash 146115361, now seen corresponding path program 1 times [2019-10-02 12:27:56,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:56,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:56,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:57,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:57,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:27:57,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:27:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:27:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:27:57,028 INFO L87 Difference]: Start difference. First operand 584 states and 918 transitions. Second operand 5 states. [2019-10-02 12:27:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:57,098 INFO L93 Difference]: Finished difference Result 1138 states and 1808 transitions. [2019-10-02 12:27:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:27:57,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-02 12:27:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:57,103 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:27:57,104 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:57,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 917 transitions. [2019-10-02 12:27:57,128 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 917 transitions. Word has length 97 [2019-10-02 12:27:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:57,128 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 917 transitions. [2019-10-02 12:27:57,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:27:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 917 transitions. [2019-10-02 12:27:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:27:57,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:57,132 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:57,132 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1759564154, now seen corresponding path program 1 times [2019-10-02 12:27:57,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:57,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:57,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:57,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:27:57,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:27:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:27:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:27:57,265 INFO L87 Difference]: Start difference. First operand 584 states and 917 transitions. Second operand 5 states. [2019-10-02 12:27:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:57,357 INFO L93 Difference]: Finished difference Result 1138 states and 1806 transitions. [2019-10-02 12:27:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:27:57,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-02 12:27:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:57,367 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:27:57,367 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:57,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 916 transitions. [2019-10-02 12:27:57,408 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 916 transitions. Word has length 98 [2019-10-02 12:27:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:57,409 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 916 transitions. [2019-10-02 12:27:57,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:27:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 916 transitions. [2019-10-02 12:27:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:27:57,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:57,412 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:57,413 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash -153149156, now seen corresponding path program 1 times [2019-10-02 12:27:57,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:57,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:27:57,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:27:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:27:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:27:57,559 INFO L87 Difference]: Start difference. First operand 584 states and 916 transitions. Second operand 5 states. [2019-10-02 12:27:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:57,622 INFO L93 Difference]: Finished difference Result 1138 states and 1804 transitions. [2019-10-02 12:27:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:27:57,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-02 12:27:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:57,628 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:27:57,628 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:57,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 915 transitions. [2019-10-02 12:27:57,657 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 915 transitions. Word has length 99 [2019-10-02 12:27:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:57,657 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 915 transitions. [2019-10-02 12:27:57,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:27:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 915 transitions. [2019-10-02 12:27:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:27:57,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:57,663 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:57,663 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1340953951, now seen corresponding path program 1 times [2019-10-02 12:27:57,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:57,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:57,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:57,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:57,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:27:57,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:27:57,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:27:57,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:27:57,844 INFO L87 Difference]: Start difference. First operand 584 states and 915 transitions. Second operand 5 states. [2019-10-02 12:27:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:57,918 INFO L93 Difference]: Finished difference Result 1138 states and 1802 transitions. [2019-10-02 12:27:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:27:57,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-02 12:27:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:57,926 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:27:57,926 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:57,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 914 transitions. [2019-10-02 12:27:57,960 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 914 transitions. Word has length 100 [2019-10-02 12:27:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:57,961 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 914 transitions. [2019-10-02 12:27:57,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:27:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 914 transitions. [2019-10-02 12:27:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:27:57,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:57,964 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:57,964 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1311064363, now seen corresponding path program 1 times [2019-10-02 12:27:57,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:57,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:58,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:58,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:27:58,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:27:58,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:27:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:27:58,200 INFO L87 Difference]: Start difference. First operand 584 states and 914 transitions. Second operand 9 states. [2019-10-02 12:27:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:58,376 INFO L93 Difference]: Finished difference Result 1140 states and 1801 transitions. [2019-10-02 12:27:58,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:27:58,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-02 12:27:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:58,385 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 12:27:58,385 INFO L226 Difference]: Without dead ends: 584 [2019-10-02 12:27:58,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:27:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-02 12:27:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-02 12:27:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 12:27:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 913 transitions. [2019-10-02 12:27:58,430 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 913 transitions. Word has length 101 [2019-10-02 12:27:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:58,432 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 913 transitions. [2019-10-02 12:27:58,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:27:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 913 transitions. [2019-10-02 12:27:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:27:58,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:58,435 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:58,436 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1044740887, now seen corresponding path program 1 times [2019-10-02 12:27:58,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:58,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:58,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:58,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:58,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:27:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:58,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:27:58,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:27:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:27:58,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:27:58,695 INFO L87 Difference]: Start difference. First operand 584 states and 913 transitions. Second operand 8 states. [2019-10-02 12:28:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:01,616 INFO L93 Difference]: Finished difference Result 2123 states and 3381 transitions. [2019-10-02 12:28:01,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:28:01,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-02 12:28:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:01,632 INFO L225 Difference]: With dead ends: 2123 [2019-10-02 12:28:01,633 INFO L226 Difference]: Without dead ends: 1573 [2019-10-02 12:28:01,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-10-02 12:28:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1561. [2019-10-02 12:28:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-10-02 12:28:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2446 transitions. [2019-10-02 12:28:01,719 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2446 transitions. Word has length 101 [2019-10-02 12:28:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:01,719 INFO L475 AbstractCegarLoop]: Abstraction has 1561 states and 2446 transitions. [2019-10-02 12:28:01,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:28:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2446 transitions. [2019-10-02 12:28:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:28:01,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:01,721 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:01,721 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1821089815, now seen corresponding path program 1 times [2019-10-02 12:28:01,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:01,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:01,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 12:28:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:28:01,962 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-10-02 12:28:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:02,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:28:02,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:28:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:28:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:28:02,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:28:02,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:28:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:28:02,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:28:02,596 INFO L87 Difference]: Start difference. First operand 1561 states and 2446 transitions. Second operand 12 states. [2019-10-02 12:28:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:08,647 INFO L93 Difference]: Finished difference Result 7631 states and 12566 transitions. [2019-10-02 12:28:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:28:08,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-02 12:28:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:08,708 INFO L225 Difference]: With dead ends: 7631 [2019-10-02 12:28:08,708 INFO L226 Difference]: Without dead ends: 6104 [2019-10-02 12:28:08,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:28:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2019-10-02 12:28:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 3934. [2019-10-02 12:28:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3934 states. [2019-10-02 12:28:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 6258 transitions. [2019-10-02 12:28:08,972 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 6258 transitions. Word has length 101 [2019-10-02 12:28:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:08,972 INFO L475 AbstractCegarLoop]: Abstraction has 3934 states and 6258 transitions. [2019-10-02 12:28:08,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:28:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 6258 transitions. [2019-10-02 12:28:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 12:28:08,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:08,974 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:08,975 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1035094428, now seen corresponding path program 1 times [2019-10-02 12:28:08,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:08,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:09,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:09,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:09,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:09,215 INFO L87 Difference]: Start difference. First operand 3934 states and 6258 transitions. Second operand 7 states. [2019-10-02 12:28:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:11,915 INFO L93 Difference]: Finished difference Result 11644 states and 18992 transitions. [2019-10-02 12:28:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:11,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-10-02 12:28:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:11,970 INFO L225 Difference]: With dead ends: 11644 [2019-10-02 12:28:11,970 INFO L226 Difference]: Without dead ends: 7744 [2019-10-02 12:28:11,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7744 states. [2019-10-02 12:28:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7744 to 7656. [2019-10-02 12:28:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-10-02 12:28:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 12303 transitions. [2019-10-02 12:28:12,492 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 12303 transitions. Word has length 104 [2019-10-02 12:28:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:12,493 INFO L475 AbstractCegarLoop]: Abstraction has 7656 states and 12303 transitions. [2019-10-02 12:28:12,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 12303 transitions. [2019-10-02 12:28:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 12:28:12,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:12,495 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:12,495 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:12,496 INFO L82 PathProgramCache]: Analyzing trace with hash 895998947, now seen corresponding path program 1 times [2019-10-02 12:28:12,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:12,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:12,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:12,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:12,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:12,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:12,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:12,643 INFO L87 Difference]: Start difference. First operand 7656 states and 12303 transitions. Second operand 4 states. [2019-10-02 12:28:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:12,917 INFO L93 Difference]: Finished difference Result 14965 states and 24312 transitions. [2019-10-02 12:28:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:12,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-02 12:28:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:13,011 INFO L225 Difference]: With dead ends: 14965 [2019-10-02 12:28:13,011 INFO L226 Difference]: Without dead ends: 7331 [2019-10-02 12:28:13,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-10-02 12:28:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7309. [2019-10-02 12:28:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7309 states. [2019-10-02 12:28:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7309 states to 7309 states and 11715 transitions. [2019-10-02 12:28:13,452 INFO L78 Accepts]: Start accepts. Automaton has 7309 states and 11715 transitions. Word has length 105 [2019-10-02 12:28:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:13,455 INFO L475 AbstractCegarLoop]: Abstraction has 7309 states and 11715 transitions. [2019-10-02 12:28:13,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7309 states and 11715 transitions. [2019-10-02 12:28:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 12:28:13,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:13,457 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:13,458 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash 371384462, now seen corresponding path program 1 times [2019-10-02 12:28:13,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:13,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 12:28:13,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:13,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:13,626 INFO L87 Difference]: Start difference. First operand 7309 states and 11715 transitions. Second operand 7 states. [2019-10-02 12:28:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:16,845 INFO L93 Difference]: Finished difference Result 21851 states and 36053 transitions. [2019-10-02 12:28:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:16,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-02 12:28:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:16,949 INFO L225 Difference]: With dead ends: 21851 [2019-10-02 12:28:16,949 INFO L226 Difference]: Without dead ends: 14576 [2019-10-02 12:28:16,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-10-02 12:28:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14452. [2019-10-02 12:28:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-10-02 12:28:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 23558 transitions. [2019-10-02 12:28:17,689 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 23558 transitions. Word has length 113 [2019-10-02 12:28:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:17,689 INFO L475 AbstractCegarLoop]: Abstraction has 14452 states and 23558 transitions. [2019-10-02 12:28:17,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 23558 transitions. [2019-10-02 12:28:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 12:28:17,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:17,691 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:17,691 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1426044095, now seen corresponding path program 1 times [2019-10-02 12:28:17,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:17,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:17,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:17,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:28:17,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:17,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:17,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:17,813 INFO L87 Difference]: Start difference. First operand 14452 states and 23558 transitions. Second operand 4 states. [2019-10-02 12:28:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:18,313 INFO L93 Difference]: Finished difference Result 28607 states and 47177 transitions. [2019-10-02 12:28:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:18,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 12:28:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:18,408 INFO L225 Difference]: With dead ends: 28607 [2019-10-02 12:28:18,408 INFO L226 Difference]: Without dead ends: 14177 [2019-10-02 12:28:18,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14177 states. [2019-10-02 12:28:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14177 to 14137. [2019-10-02 12:28:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14137 states. [2019-10-02 12:28:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 22989 transitions. [2019-10-02 12:28:20,084 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 22989 transitions. Word has length 114 [2019-10-02 12:28:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:20,085 INFO L475 AbstractCegarLoop]: Abstraction has 14137 states and 22989 transitions. [2019-10-02 12:28:20,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 22989 transitions. [2019-10-02 12:28:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:28:20,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:20,087 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:20,087 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash -409974559, now seen corresponding path program 1 times [2019-10-02 12:28:20,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:20,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:20,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:28:20,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:20,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:20,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:20,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:20,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:20,212 INFO L87 Difference]: Start difference. First operand 14137 states and 22989 transitions. Second operand 7 states. [2019-10-02 12:28:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:23,025 INFO L93 Difference]: Finished difference Result 42451 states and 71546 transitions. [2019-10-02 12:28:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:23,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-10-02 12:28:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:23,180 INFO L225 Difference]: With dead ends: 42451 [2019-10-02 12:28:23,180 INFO L226 Difference]: Without dead ends: 28348 [2019-10-02 12:28:23,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28348 states. [2019-10-02 12:28:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28348 to 28164. [2019-10-02 12:28:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28164 states. [2019-10-02 12:28:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28164 states to 28164 states and 47019 transitions. [2019-10-02 12:28:24,351 INFO L78 Accepts]: Start accepts. Automaton has 28164 states and 47019 transitions. Word has length 123 [2019-10-02 12:28:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:24,351 INFO L475 AbstractCegarLoop]: Abstraction has 28164 states and 47019 transitions. [2019-10-02 12:28:24,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28164 states and 47019 transitions. [2019-10-02 12:28:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:28:24,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:24,353 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:24,353 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1443381654, now seen corresponding path program 1 times [2019-10-02 12:28:24,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:24,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:24,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 12:28:24,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:24,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:24,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:24,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:24,468 INFO L87 Difference]: Start difference. First operand 28164 states and 47019 transitions. Second operand 4 states. [2019-10-02 12:28:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:25,377 INFO L93 Difference]: Finished difference Result 56081 states and 94983 transitions. [2019-10-02 12:28:25,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:25,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-02 12:28:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:25,554 INFO L225 Difference]: With dead ends: 56081 [2019-10-02 12:28:25,554 INFO L226 Difference]: Without dead ends: 27939 [2019-10-02 12:28:25,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27939 states. [2019-10-02 12:28:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27939 to 27863. [2019-10-02 12:28:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27863 states. [2019-10-02 12:28:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27863 states to 27863 states and 46417 transitions. [2019-10-02 12:28:28,046 INFO L78 Accepts]: Start accepts. Automaton has 27863 states and 46417 transitions. Word has length 124 [2019-10-02 12:28:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:28,047 INFO L475 AbstractCegarLoop]: Abstraction has 27863 states and 46417 transitions. [2019-10-02 12:28:28,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27863 states and 46417 transitions. [2019-10-02 12:28:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:28:28,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:28,049 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:28,049 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1100507535, now seen corresponding path program 1 times [2019-10-02 12:28:28,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:28,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:28:28,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:28,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:28,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:28,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:28,166 INFO L87 Difference]: Start difference. First operand 27863 states and 46417 transitions. Second operand 7 states. [2019-10-02 12:28:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:31,626 INFO L93 Difference]: Finished difference Result 83801 states and 146321 transitions. [2019-10-02 12:28:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:28:31,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-02 12:28:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:32,048 INFO L225 Difference]: With dead ends: 83801 [2019-10-02 12:28:32,049 INFO L226 Difference]: Without dead ends: 55972 [2019-10-02 12:28:32,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:28:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55972 states. [2019-10-02 12:28:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55972 to 55688. [2019-10-02 12:28:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55688 states. [2019-10-02 12:28:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55688 states to 55688 states and 96602 transitions. [2019-10-02 12:28:34,215 INFO L78 Accepts]: Start accepts. Automaton has 55688 states and 96602 transitions. Word has length 134 [2019-10-02 12:28:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:34,216 INFO L475 AbstractCegarLoop]: Abstraction has 55688 states and 96602 transitions. [2019-10-02 12:28:34,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 55688 states and 96602 transitions. [2019-10-02 12:28:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:28:34,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:34,217 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:34,217 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1461519794, now seen corresponding path program 1 times [2019-10-02 12:28:34,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:28:34,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:34,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:34,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:34,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:34,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:34,338 INFO L87 Difference]: Start difference. First operand 55688 states and 96602 transitions. Second operand 4 states. [2019-10-02 12:28:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:37,514 INFO L93 Difference]: Finished difference Result 110502 states and 195295 transitions. [2019-10-02 12:28:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:37,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 12:28:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:37,850 INFO L225 Difference]: With dead ends: 110502 [2019-10-02 12:28:37,850 INFO L226 Difference]: Without dead ends: 54830 [2019-10-02 12:28:38,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54830 states. [2019-10-02 12:28:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54830 to 54686. [2019-10-02 12:28:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54686 states. [2019-10-02 12:28:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54686 states to 54686 states and 94465 transitions. [2019-10-02 12:28:39,827 INFO L78 Accepts]: Start accepts. Automaton has 54686 states and 94465 transitions. Word has length 135 [2019-10-02 12:28:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:39,828 INFO L475 AbstractCegarLoop]: Abstraction has 54686 states and 94465 transitions. [2019-10-02 12:28:39,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54686 states and 94465 transitions. [2019-10-02 12:28:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:28:39,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:39,829 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:39,829 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1991153626, now seen corresponding path program 1 times [2019-10-02 12:28:39,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:39,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:39,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:28:39,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:39,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:28:39,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:28:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:28:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:28:39,951 INFO L87 Difference]: Start difference. First operand 54686 states and 94465 transitions. Second operand 3 states. [2019-10-02 12:28:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:41,999 INFO L93 Difference]: Finished difference Result 111952 states and 192054 transitions. [2019-10-02 12:28:42,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:28:42,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-02 12:28:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:42,336 INFO L225 Difference]: With dead ends: 111952 [2019-10-02 12:28:42,336 INFO L226 Difference]: Without dead ends: 58519 [2019-10-02 12:28:42,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:28:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58519 states. [2019-10-02 12:28:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58519 to 57957. [2019-10-02 12:28:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57957 states. [2019-10-02 12:28:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57957 states to 57957 states and 100342 transitions. [2019-10-02 12:28:46,774 INFO L78 Accepts]: Start accepts. Automaton has 57957 states and 100342 transitions. Word has length 136 [2019-10-02 12:28:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:46,774 INFO L475 AbstractCegarLoop]: Abstraction has 57957 states and 100342 transitions. [2019-10-02 12:28:46,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:28:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57957 states and 100342 transitions. [2019-10-02 12:28:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:28:46,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:46,777 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:46,778 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1002569047, now seen corresponding path program 1 times [2019-10-02 12:28:46,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:46,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:46,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:28:46,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:28:46,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:28:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:28:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:28:46,941 INFO L87 Difference]: Start difference. First operand 57957 states and 100342 transitions. Second operand 10 states. [2019-10-02 12:28:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:50,409 INFO L93 Difference]: Finished difference Result 130003 states and 235746 transitions. [2019-10-02 12:28:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:28:50,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2019-10-02 12:28:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:50,783 INFO L225 Difference]: With dead ends: 130003 [2019-10-02 12:28:50,783 INFO L226 Difference]: Without dead ends: 72080 [2019-10-02 12:28:51,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:28:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72080 states. [2019-10-02 12:28:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72080 to 72076. [2019-10-02 12:28:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72076 states. [2019-10-02 12:28:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72076 states to 72076 states and 128584 transitions. [2019-10-02 12:28:56,478 INFO L78 Accepts]: Start accepts. Automaton has 72076 states and 128584 transitions. Word has length 173 [2019-10-02 12:28:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:56,479 INFO L475 AbstractCegarLoop]: Abstraction has 72076 states and 128584 transitions. [2019-10-02 12:28:56,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:28:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 72076 states and 128584 transitions. [2019-10-02 12:28:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:28:56,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:56,482 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:28:56,482 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1658933069, now seen corresponding path program 1 times [2019-10-02 12:28:56,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:28:56,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:56,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:28:56,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:28:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:28:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:28:56,678 INFO L87 Difference]: Start difference. First operand 72076 states and 128584 transitions. Second operand 14 states. [2019-10-02 12:29:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:17,209 INFO L93 Difference]: Finished difference Result 249938 states and 522757 transitions. [2019-10-02 12:29:17,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:29:17,210 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 174 [2019-10-02 12:29:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:18,191 INFO L225 Difference]: With dead ends: 249938 [2019-10-02 12:29:18,191 INFO L226 Difference]: Without dead ends: 177794 [2019-10-02 12:29:18,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=2235, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 12:29:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177794 states. [2019-10-02 12:29:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177794 to 167620. [2019-10-02 12:29:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167620 states. [2019-10-02 12:29:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167620 states to 167620 states and 302374 transitions. [2019-10-02 12:29:32,652 INFO L78 Accepts]: Start accepts. Automaton has 167620 states and 302374 transitions. Word has length 174 [2019-10-02 12:29:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:32,653 INFO L475 AbstractCegarLoop]: Abstraction has 167620 states and 302374 transitions. [2019-10-02 12:29:32,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:29:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 167620 states and 302374 transitions. [2019-10-02 12:29:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:29:32,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:32,657 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:32,657 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1403239656, now seen corresponding path program 1 times [2019-10-02 12:29:32,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:32,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:32,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:32,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:29:32,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:32,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:29:32,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:29:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:29:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:29:32,872 INFO L87 Difference]: Start difference. First operand 167620 states and 302374 transitions. Second operand 14 states. [2019-10-02 12:30:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:16,693 INFO L93 Difference]: Finished difference Result 556674 states and 1146955 transitions. [2019-10-02 12:30:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:30:16,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2019-10-02 12:30:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:20,196 INFO L225 Difference]: With dead ends: 556674 [2019-10-02 12:30:20,196 INFO L226 Difference]: Without dead ends: 388810 [2019-10-02 12:30:29,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=2141, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 12:30:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388810 states. [2019-10-02 12:30:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388810 to 362876. [2019-10-02 12:30:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362876 states. [2019-10-02 12:31:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362876 states to 362876 states and 658694 transitions. [2019-10-02 12:31:05,356 INFO L78 Accepts]: Start accepts. Automaton has 362876 states and 658694 transitions. Word has length 175 [2019-10-02 12:31:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:05,357 INFO L475 AbstractCegarLoop]: Abstraction has 362876 states and 658694 transitions. [2019-10-02 12:31:05,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:31:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 362876 states and 658694 transitions. [2019-10-02 12:31:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:31:05,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:05,360 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:05,360 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2032097239, now seen corresponding path program 1 times [2019-10-02 12:31:05,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:05,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:31:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:31:05,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:31:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:31:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:31:05,576 INFO L87 Difference]: Start difference. First operand 362876 states and 658694 transitions. Second operand 14 states. [2019-10-02 12:32:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:27,740 INFO L93 Difference]: Finished difference Result 1025410 states and 2102243 transitions. [2019-10-02 12:32:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:32:27,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 176 [2019-10-02 12:32:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:45,365 INFO L225 Difference]: With dead ends: 1025410 [2019-10-02 12:32:45,365 INFO L226 Difference]: Without dead ends: 661764 [2019-10-02 12:33:01,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=2141, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 12:33:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661764 states.