/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:34:28,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:34:28,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:34:28,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:34:28,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:34:28,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:34:28,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:34:28,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:34:28,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:34:28,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:34:28,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:34:28,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:34:28,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:34:28,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:34:28,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:34:28,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:34:28,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:34:28,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:34:28,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:34:28,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:34:28,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:34:28,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:34:28,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:34:28,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:34:28,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:34:28,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:34:28,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:34:28,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:34:28,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:34:28,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:34:28,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:34:28,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:34:28,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:34:28,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:34:28,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:34:28,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:34:28,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:34:28,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:34:28,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:34:28,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:34:28,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:34:28,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:34:28,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:34:28,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:34:28,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:34:28,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:34:28,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:34:28,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:34:28,424 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:34:28,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:34:28,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:34:28,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:34:28,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:34:28,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:34:28,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:34:28,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:34:28,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:34:28,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:34:28,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:34:28,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:34:28,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:34:28,428 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:34:28,428 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 05:34:28,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:34:28,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:34:28,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:34:28,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:34:28,651 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:34:28,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2022-01-11 05:34:28,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3c93094/f3feb3c127864b448954e4a3a5af0aa0/FLAG4e99d27b4 [2022-01-11 05:34:29,178 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:34:29,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2022-01-11 05:34:29,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3c93094/f3feb3c127864b448954e4a3a5af0aa0/FLAG4e99d27b4 [2022-01-11 05:34:29,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3c93094/f3feb3c127864b448954e4a3a5af0aa0 [2022-01-11 05:34:29,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:34:29,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:34:29,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:34:29,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:34:29,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:34:29,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:34:29" (1/1) ... [2022-01-11 05:34:29,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fea342e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:29, skipping insertion in model container [2022-01-11 05:34:29,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:34:29" (1/1) ... [2022-01-11 05:34:29,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:34:29,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:34:29,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c[4370,4383] [2022-01-11 05:34:30,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:34:30,127 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-11 05:34:30,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:34:30,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c[4370,4383] [2022-01-11 05:34:30,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:34:30,222 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:34:30,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c[4370,4383] [2022-01-11 05:34:30,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:34:30,353 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:34:30,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30 WrapperNode [2022-01-11 05:34:30,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:34:30,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:34:30,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:34:30,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:34:30,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:30,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:31,081 INFO L137 Inliner]: procedures = 112, calls = 382, calls flagged for inlining = 234, calls inlined = 2549, statements flattened = 81536 [2022-01-11 05:34:31,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:34:31,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:34:31,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:34:31,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:34:31,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:31,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:31,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:31,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:31,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:32,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:32,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:32,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:34:32,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:34:32,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:34:32,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:34:32,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (1/1) ... [2022-01-11 05:34:32,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:34:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:34:32,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 05:34:32,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 05:34:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:34:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:34:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:34:32,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:34:32,599 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:34:32,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:34:53,695 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint getCurrentFloorID_returnLabel#42: __utac_acc__Specification2_spec__3_#t~ret10#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification2_spec__3_~tmp~2#1 := __utac_acc__Specification2_spec__3_#t~ret10#1;havoc __utac_acc__Specification2_spec__3_#t~ret10#1;__utac_acc__Specification2_spec__3_~floor~0#1 := __utac_acc__Specification2_spec__3_~tmp~2#1; [2022-01-11 05:34:53,696 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint getCurrentFloorID_returnLabel#21: __utac_acc__Specification2_spec__3_#t~ret10#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification2_spec__3_~tmp~2#1 := __utac_acc__Specification2_spec__3_#t~ret10#1;havoc __utac_acc__Specification2_spec__3_#t~ret10#1;__utac_acc__Specification2_spec__3_~floor~0#1 := __utac_acc__Specification2_spec__3_~tmp~2#1; [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-2: assume 0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-2: assume !(0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-5: assume 0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-5: assume !(0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: assume 0bv32 != ~floorButtons_spc2_0~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: assume !(0bv32 != ~floorButtons_spc2_0~0); [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-5: assume 0bv32 != ~floorButtons_spc2_0~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-5: assume !(0bv32 != ~floorButtons_spc2_0~0); [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1;~floorButtons_spc2_0~0 := 0bv32; [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1); [2022-01-11 05:34:53,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1;~floorButtons_spc2_0~0 := 0bv32; [2022-01-11 05:34:53,698 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1); [2022-01-11 05:34:53,698 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-2: assume 1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-2: assume !(1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-5: assume 1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-5: assume !(1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: assume 0bv32 != ~floorButtons_spc2_1~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: assume !(0bv32 != ~floorButtons_spc2_1~0); [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-5: assume 0bv32 != ~floorButtons_spc2_1~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-5: assume !(0bv32 != ~floorButtons_spc2_1~0); [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1;~floorButtons_spc2_1~0 := 0bv32; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1); [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1;~floorButtons_spc2_1~0 := 0bv32; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1); [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-2: assume 2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,699 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-2: assume !(2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-5: assume 2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-5: assume !(2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: assume 0bv32 != ~floorButtons_spc2_2~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: assume !(0bv32 != ~floorButtons_spc2_2~0); [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-5: assume 0bv32 != ~floorButtons_spc2_2~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-5: assume !(0bv32 != ~floorButtons_spc2_2~0); [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1;~floorButtons_spc2_2~0 := 0bv32; [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1); [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1;~floorButtons_spc2_2~0 := 0bv32; [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1); [2022-01-11 05:34:53,700 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-2: assume 3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-2: assume !(3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-5: assume 3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-5: assume !(3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume 0bv32 != ~floorButtons_spc2_3~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume !(0bv32 != ~floorButtons_spc2_3~0); [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-5: assume 0bv32 != ~floorButtons_spc2_3~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,701 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-5: assume !(0bv32 != ~floorButtons_spc2_3~0); [2022-01-11 05:34:53,702 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1;~floorButtons_spc2_3~0 := 0bv32; [2022-01-11 05:34:53,702 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1); [2022-01-11 05:34:53,702 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1;~floorButtons_spc2_3~0 := 0bv32; [2022-01-11 05:34:53,702 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1); [2022-01-11 05:34:53,702 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: assume 4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,703 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: assume !(4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,703 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-5: assume 4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-11 05:34:53,703 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-5: assume !(4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-11 05:34:53,703 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076-2: assume { :end_inline___utac_acc__Specification2_spec__3 } true; [2022-01-11 05:34:53,703 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076-5: assume { :end_inline___utac_acc__Specification2_spec__3 } true; [2022-01-11 05:34:53,703 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-4: assume 0bv32 != ~floorButtons_spc2_4~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,704 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-4: assume !(0bv32 != ~floorButtons_spc2_4~0); [2022-01-11 05:34:53,704 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-10: assume 0bv32 != ~floorButtons_spc2_4~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-11 05:34:53,704 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-10: assume !(0bv32 != ~floorButtons_spc2_4~0); [2022-01-11 05:34:53,704 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-6: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1;~floorButtons_spc2_4~0 := 0bv32; [2022-01-11 05:34:53,704 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-6: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1); [2022-01-11 05:34:53,705 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-15: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1;~floorButtons_spc2_4~0 := 0bv32; [2022-01-11 05:34:53,705 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-15: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1); [2022-01-11 05:34:53,708 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-12: __utac_acc__Specification2_spec__3_#t~ret12#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___3~0#1 := __utac_acc__Specification2_spec__3_#t~ret12#1;havoc __utac_acc__Specification2_spec__3_#t~ret12#1; [2022-01-11 05:34:53,708 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-11: __utac_acc__Specification2_spec__3_#t~ret11#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___4~0#1 := __utac_acc__Specification2_spec__3_#t~ret11#1;havoc __utac_acc__Specification2_spec__3_#t~ret11#1; [2022-01-11 05:34:53,708 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-14: __utac_acc__Specification2_spec__3_#t~ret14#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___1~2#1 := __utac_acc__Specification2_spec__3_#t~ret14#1;havoc __utac_acc__Specification2_spec__3_#t~ret14#1; [2022-01-11 05:34:53,708 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-13: __utac_acc__Specification2_spec__3_#t~ret13#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___2~0#1 := __utac_acc__Specification2_spec__3_#t~ret13#1;havoc __utac_acc__Specification2_spec__3_#t~ret13#1; [2022-01-11 05:34:53,708 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-15: __utac_acc__Specification2_spec__3_#t~ret15#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___0~2#1 := __utac_acc__Specification2_spec__3_#t~ret15#1;havoc __utac_acc__Specification2_spec__3_#t~ret15#1; [2022-01-11 05:34:53,708 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-28: __utac_acc__Specification2_spec__3_#t~ret12#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___3~0#1 := __utac_acc__Specification2_spec__3_#t~ret12#1;havoc __utac_acc__Specification2_spec__3_#t~ret12#1; [2022-01-11 05:34:53,709 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-27: __utac_acc__Specification2_spec__3_#t~ret11#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___4~0#1 := __utac_acc__Specification2_spec__3_#t~ret11#1;havoc __utac_acc__Specification2_spec__3_#t~ret11#1; [2022-01-11 05:34:53,709 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-30: __utac_acc__Specification2_spec__3_#t~ret14#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___1~2#1 := __utac_acc__Specification2_spec__3_#t~ret14#1;havoc __utac_acc__Specification2_spec__3_#t~ret14#1; [2022-01-11 05:34:53,709 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-29: __utac_acc__Specification2_spec__3_#t~ret13#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___2~0#1 := __utac_acc__Specification2_spec__3_#t~ret13#1;havoc __utac_acc__Specification2_spec__3_#t~ret13#1; [2022-01-11 05:34:53,709 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-31: __utac_acc__Specification2_spec__3_#t~ret15#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___0~2#1 := __utac_acc__Specification2_spec__3_#t~ret15#1;havoc __utac_acc__Specification2_spec__3_#t~ret15#1; [2022-01-11 05:34:53,712 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:34:53,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:34:53,813 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 05:34:53,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:34:53 BoogieIcfgContainer [2022-01-11 05:34:53,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:34:53,835 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:34:53,835 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:34:53,837 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:34:53,839 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:34:53" (1/1) ... [2022-01-11 05:34:56,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:34:56 BasicIcfg [2022-01-11 05:34:56,896 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:34:56,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:34:56,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:34:56,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:34:56,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:34:29" (1/4) ... [2022-01-11 05:34:56,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a8fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:34:56, skipping insertion in model container [2022-01-11 05:34:56,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:34:30" (2/4) ... [2022-01-11 05:34:56,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a8fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:34:56, skipping insertion in model container [2022-01-11 05:34:56,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:34:53" (3/4) ... [2022-01-11 05:34:56,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a8fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:34:56, skipping insertion in model container [2022-01-11 05:34:56,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:34:56" (4/4) ... [2022-01-11 05:34:56,903 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec2_productSimulator.cil.cTransformedIcfg [2022-01-11 05:34:56,909 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:34:56,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-11 05:34:57,018 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:34:57,022 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 05:34:57,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-11 05:34:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 20674 states, 20668 states have (on average 1.8712502419198762) internal successors, (38675), 20673 states have internal predecessors, (38675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:34:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-11 05:34:57,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:34:57,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:34:57,289 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:34:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:34:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1203949540, now seen corresponding path program 1 times [2022-01-11 05:34:57,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:34:57,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603442333] [2022-01-11 05:34:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:34:57,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:34:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:34:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:34:57,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:34:57,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603442333] [2022-01-11 05:34:57,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603442333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:34:57,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:34:57,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:34:57,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502661635] [2022-01-11 05:34:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:34:57,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:34:57,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:34:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:34:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:34:57,751 INFO L87 Difference]: Start difference. First operand has 20674 states, 20668 states have (on average 1.8712502419198762) internal successors, (38675), 20673 states have internal predecessors, (38675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:34:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:34:58,573 INFO L93 Difference]: Finished difference Result 41322 states and 77311 transitions. [2022-01-11 05:34:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:34:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-11 05:34:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:34:58,672 INFO L225 Difference]: With dead ends: 41322 [2022-01-11 05:34:58,673 INFO L226 Difference]: Without dead ends: 20663 [2022-01-11 05:34:58,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:34:58,713 INFO L933 BasicCegarLoop]: 38654 mSDtfsCounter, 38633 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38633 SdHoareTripleChecker+Valid, 38681 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:34:58,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38633 Valid, 38681 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:34:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20663 states. [2022-01-11 05:34:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20663 to 20663. [2022-01-11 05:34:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20663 states, 20658 states have (on average 1.8709942879271952) internal successors, (38651), 20662 states have internal predecessors, (38651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:34:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20663 states to 20663 states and 38651 transitions. [2022-01-11 05:34:59,407 INFO L78 Accepts]: Start accepts. Automaton has 20663 states and 38651 transitions. Word has length 42 [2022-01-11 05:34:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:34:59,407 INFO L470 AbstractCegarLoop]: Abstraction has 20663 states and 38651 transitions. [2022-01-11 05:34:59,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:34:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20663 states and 38651 transitions. [2022-01-11 05:34:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-11 05:34:59,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:34:59,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:34:59,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:34:59,411 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:34:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:34:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 528971934, now seen corresponding path program 1 times [2022-01-11 05:34:59,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:34:59,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479400666] [2022-01-11 05:34:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:34:59,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:34:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:34:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:34:59,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:34:59,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479400666] [2022-01-11 05:34:59,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479400666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:34:59,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:34:59,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:34:59,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188680157] [2022-01-11 05:34:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:34:59,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:34:59,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:34:59,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:34:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:34:59,507 INFO L87 Difference]: Start difference. First operand 20663 states and 38651 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:35:00,163 INFO L93 Difference]: Finished difference Result 41265 states and 77200 transitions. [2022-01-11 05:35:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:35:00,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-11 05:35:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:35:00,218 INFO L225 Difference]: With dead ends: 41265 [2022-01-11 05:35:00,218 INFO L226 Difference]: Without dead ends: 20663 [2022-01-11 05:35:00,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:00,252 INFO L933 BasicCegarLoop]: 38591 mSDtfsCounter, 38593 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38593 SdHoareTripleChecker+Valid, 38622 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:35:00,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38593 Valid, 38622 Invalid, 59 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [24 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:35:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20663 states. [2022-01-11 05:35:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20663 to 20663. [2022-01-11 05:35:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20663 states, 20658 states have (on average 1.8697841030109401) internal successors, (38626), 20662 states have internal predecessors, (38626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20663 states to 20663 states and 38626 transitions. [2022-01-11 05:35:00,846 INFO L78 Accepts]: Start accepts. Automaton has 20663 states and 38626 transitions. Word has length 49 [2022-01-11 05:35:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:35:00,846 INFO L470 AbstractCegarLoop]: Abstraction has 20663 states and 38626 transitions. [2022-01-11 05:35:00,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 20663 states and 38626 transitions. [2022-01-11 05:35:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 05:35:00,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:35:00,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:35:00,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:35:00,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:35:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:35:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 32260521, now seen corresponding path program 1 times [2022-01-11 05:35:00,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:35:00,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752184830] [2022-01-11 05:35:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:35:00,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:35:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:35:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:35:00,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:35:00,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752184830] [2022-01-11 05:35:00,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752184830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:35:00,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:35:00,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:35:00,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936061365] [2022-01-11 05:35:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:35:00,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:35:00,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:35:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:35:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:00,948 INFO L87 Difference]: Start difference. First operand 20663 states and 38626 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:35:01,766 INFO L93 Difference]: Finished difference Result 43401 states and 81165 transitions. [2022-01-11 05:35:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:35:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 05:35:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:35:01,859 INFO L225 Difference]: With dead ends: 43401 [2022-01-11 05:35:01,859 INFO L226 Difference]: Without dead ends: 33031 [2022-01-11 05:35:01,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:01,892 INFO L933 BasicCegarLoop]: 40601 mSDtfsCounter, 38545 mSDsluCounter, 23119 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38545 SdHoareTripleChecker+Valid, 63720 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:35:01,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38545 Valid, 63720 Invalid, 60 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:35:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33031 states. [2022-01-11 05:35:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33031 to 33031. [2022-01-11 05:35:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33031 states, 33026 states have (on average 1.870465693695876) internal successors, (61774), 33030 states have internal predecessors, (61774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33031 states to 33031 states and 61774 transitions. [2022-01-11 05:35:02,831 INFO L78 Accepts]: Start accepts. Automaton has 33031 states and 61774 transitions. Word has length 52 [2022-01-11 05:35:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:35:02,831 INFO L470 AbstractCegarLoop]: Abstraction has 33031 states and 61774 transitions. [2022-01-11 05:35:02,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 33031 states and 61774 transitions. [2022-01-11 05:35:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 05:35:02,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:35:02,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:35:02,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:35:02,835 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:35:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:35:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1607475959, now seen corresponding path program 1 times [2022-01-11 05:35:02,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:35:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107352906] [2022-01-11 05:35:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:35:02,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:35:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:35:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:35:02,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:35:02,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107352906] [2022-01-11 05:35:02,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107352906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:35:02,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:35:02,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:35:02,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840246375] [2022-01-11 05:35:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:35:02,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:35:02,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:35:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:35:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:02,887 INFO L87 Difference]: Start difference. First operand 33031 states and 61774 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:35:03,813 INFO L93 Difference]: Finished difference Result 78093 states and 146081 transitions. [2022-01-11 05:35:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:35:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-01-11 05:35:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:35:03,960 INFO L225 Difference]: With dead ends: 78093 [2022-01-11 05:35:03,960 INFO L226 Difference]: Without dead ends: 57387 [2022-01-11 05:35:04,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:04,001 INFO L933 BasicCegarLoop]: 38621 mSDtfsCounter, 38533 mSDsluCounter, 23122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38533 SdHoareTripleChecker+Valid, 61743 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:35:04,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38533 Valid, 61743 Invalid, 60 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:35:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57387 states. [2022-01-11 05:35:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57387 to 57385. [2022-01-11 05:35:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57385 states, 57380 states have (on average 1.8708260718020215) internal successors, (107348), 57384 states have internal predecessors, (107348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57385 states to 57385 states and 107348 transitions. [2022-01-11 05:35:05,396 INFO L78 Accepts]: Start accepts. Automaton has 57385 states and 107348 transitions. Word has length 54 [2022-01-11 05:35:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:35:05,397 INFO L470 AbstractCegarLoop]: Abstraction has 57385 states and 107348 transitions. [2022-01-11 05:35:05,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 57385 states and 107348 transitions. [2022-01-11 05:35:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 05:35:05,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:35:05,401 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:35:05,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:35:05,401 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:35:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:35:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1707953104, now seen corresponding path program 1 times [2022-01-11 05:35:05,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:35:05,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133583049] [2022-01-11 05:35:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:35:05,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:35:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:35:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:35:05,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:35:05,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133583049] [2022-01-11 05:35:05,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133583049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:35:05,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:35:05,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:35:05,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399697653] [2022-01-11 05:35:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:35:05,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:35:05,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:35:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:35:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:05,449 INFO L87 Difference]: Start difference. First operand 57385 states and 107348 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:35:07,166 INFO L93 Difference]: Finished difference Result 146691 states and 274432 transitions. [2022-01-11 05:35:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:35:07,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 05:35:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:35:07,438 INFO L225 Difference]: With dead ends: 146691 [2022-01-11 05:35:07,438 INFO L226 Difference]: Without dead ends: 105332 [2022-01-11 05:35:07,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:07,508 INFO L933 BasicCegarLoop]: 38621 mSDtfsCounter, 38532 mSDsluCounter, 23125 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38532 SdHoareTripleChecker+Valid, 61746 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:35:07,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38532 Valid, 61746 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:35:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105332 states. [2022-01-11 05:35:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105332 to 105328. [2022-01-11 05:35:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105328 states, 105323 states have (on average 1.8709113868765608) internal successors, (197050), 105327 states have internal predecessors, (197050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105328 states to 105328 states and 197050 transitions. [2022-01-11 05:35:10,117 INFO L78 Accepts]: Start accepts. Automaton has 105328 states and 197050 transitions. Word has length 55 [2022-01-11 05:35:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:35:10,117 INFO L470 AbstractCegarLoop]: Abstraction has 105328 states and 197050 transitions. [2022-01-11 05:35:10,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 105328 states and 197050 transitions. [2022-01-11 05:35:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 05:35:10,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:35:10,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:35:10,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:35:10,121 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:35:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:35:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1407039127, now seen corresponding path program 1 times [2022-01-11 05:35:10,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:35:10,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156184876] [2022-01-11 05:35:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:35:10,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:35:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:35:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:35:10,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:35:10,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156184876] [2022-01-11 05:35:10,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156184876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:35:10,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:35:10,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:35:10,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128972635] [2022-01-11 05:35:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:35:10,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:35:10,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:35:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:35:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:10,191 INFO L87 Difference]: Start difference. First operand 105328 states and 197050 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:35:12,938 INFO L93 Difference]: Finished difference Result 282315 states and 528169 transitions. [2022-01-11 05:35:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:35:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 05:35:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:35:13,456 INFO L225 Difference]: With dead ends: 282315 [2022-01-11 05:35:13,456 INFO L226 Difference]: Without dead ends: 199689 [2022-01-11 05:35:13,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:13,548 INFO L933 BasicCegarLoop]: 38621 mSDtfsCounter, 38531 mSDsluCounter, 23128 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38531 SdHoareTripleChecker+Valid, 61749 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:35:13,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38531 Valid, 61749 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:35:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199689 states. [2022-01-11 05:35:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199689 to 199683. [2022-01-11 05:35:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199683 states, 199678 states have (on average 1.8708120073318042) internal successors, (373560), 199682 states have internal predecessors, (373560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199683 states to 199683 states and 373560 transitions. [2022-01-11 05:35:17,919 INFO L78 Accepts]: Start accepts. Automaton has 199683 states and 373560 transitions. Word has length 56 [2022-01-11 05:35:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:35:17,920 INFO L470 AbstractCegarLoop]: Abstraction has 199683 states and 373560 transitions. [2022-01-11 05:35:17,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 199683 states and 373560 transitions. [2022-01-11 05:35:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 05:35:17,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:35:17,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:35:17,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 05:35:17,925 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:35:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:35:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 668640650, now seen corresponding path program 1 times [2022-01-11 05:35:17,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:35:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084722724] [2022-01-11 05:35:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:35:17,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:35:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:35:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:35:17,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:35:17,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084722724] [2022-01-11 05:35:17,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084722724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:35:17,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:35:17,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:35:17,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043634924] [2022-01-11 05:35:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:35:17,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:35:17,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:35:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:35:17,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:35:17,974 INFO L87 Difference]: Start difference. First operand 199683 states and 373560 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:35:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:35:23,546 INFO L93 Difference]: Finished difference Result 550419 states and 1029709 transitions. [2022-01-11 05:35:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:35:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-01-11 05:35:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted.