./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64b60b46be25872d2112a950c23ddbe99bccee21bea4e463fd90753650d2a7bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:37:58,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:37:58,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:37:58,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:37:58,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:37:58,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:37:58,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:37:58,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:37:58,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:37:58,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:37:58,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:37:58,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:37:58,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:37:58,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:37:58,536 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:37:58,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:37:58,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:37:58,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:37:58,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:37:58,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:37:58,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:37:58,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:37:58,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:37:58,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:37:58,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:37:58,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:37:58,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:37:58,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:37:58,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:37:58,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:37:58,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:37:58,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:37:58,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:58,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:37:58,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:37:58,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:37:58,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:37:58,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:37:58,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:37:58,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:37:58,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:37:58,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:37:58,548 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64b60b46be25872d2112a950c23ddbe99bccee21bea4e463fd90753650d2a7bd [2024-10-11 02:37:58,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:37:58,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:37:58,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:37:58,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:37:58,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:37:58,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c [2024-10-11 02:38:00,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:38:00,570 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:38:00,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c [2024-10-11 02:38:00,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d8b103cb/11f1cfbf60f64da89ee077cd46b356df/FLAG9d13b6f6c [2024-10-11 02:38:00,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d8b103cb/11f1cfbf60f64da89ee077cd46b356df [2024-10-11 02:38:00,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:38:00,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:38:00,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:00,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:38:00,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:38:00,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:00" (1/1) ... [2024-10-11 02:38:00,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569dcf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:00, skipping insertion in model container [2024-10-11 02:38:00,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:00" (1/1) ... [2024-10-11 02:38:00,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:38:01,260 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c[67702,67715] [2024-10-11 02:38:01,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:01,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:38:01,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-11 02:38:01,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [67] [2024-10-11 02:38:01,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [168] [2024-10-11 02:38:01,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [520] [2024-10-11 02:38:01,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2041] [2024-10-11 02:38:01,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2407] [2024-10-11 02:38:01,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3068] [2024-10-11 02:38:01,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3186] [2024-10-11 02:38:01,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3195] [2024-10-11 02:38:01,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [3230] [2024-10-11 02:38:01,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c[67702,67715] [2024-10-11 02:38:01,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:01,455 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:38:01,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01 WrapperNode [2024-10-11 02:38:01,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:01,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:01,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:38:01,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:38:01,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,555 INFO L138 Inliner]: procedures = 91, calls = 346, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 862 [2024-10-11 02:38:01,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:01,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:38:01,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:38:01,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:38:01,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,611 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:38:01,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:38:01,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:38:01,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:38:01,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:38:01,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (1/1) ... [2024-10-11 02:38:01,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:01,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:38:01,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:38:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:38:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:38:01,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:38:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:38:01,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:38:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:38:01,782 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:38:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:38:01,783 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:38:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:38:01,784 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:38:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:38:01,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:38:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:38:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:38:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:38:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:38:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:38:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:38:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:38:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:38:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:38:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:38:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:38:01,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:38:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:38:01,786 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:38:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:38:01,787 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:38:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:38:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:38:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:38:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:38:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-10-11 02:38:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-10-11 02:38:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:38:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:38:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:38:01,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:38:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:38:01,790 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:38:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:38:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:38:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:38:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:38:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:38:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:38:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:38:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:38:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:38:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:38:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:38:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:38:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:38:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:38:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:38:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:38:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:38:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:38:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:38:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:38:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:38:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:38:01,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:38:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:38:01,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:38:02,018 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:38:02,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:38:03,304 INFO L? ?]: Removed 451 outVars from TransFormulas that were not future-live. [2024-10-11 02:38:03,304 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:38:03,390 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:38:03,394 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:38:03,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:03 BoogieIcfgContainer [2024-10-11 02:38:03,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:38:03,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:38:03,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:38:03,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:38:03,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:38:00" (1/3) ... [2024-10-11 02:38:03,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd72235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:03, skipping insertion in model container [2024-10-11 02:38:03,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:01" (2/3) ... [2024-10-11 02:38:03,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd72235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:03, skipping insertion in model container [2024-10-11 02:38:03,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:03" (3/3) ... [2024-10-11 02:38:03,406 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product26.cil.c [2024-10-11 02:38:03,423 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:38:03,424 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:38:03,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:38:03,519 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d8d1e72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:38:03,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:38:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 556 states, 427 states have (on average 1.721311475409836) internal successors, (735), 447 states have internal predecessors, (735), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 02:38:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:38:03,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:03,550 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:03,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1610879925, now seen corresponding path program 1 times [2024-10-11 02:38:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863953276] [2024-10-11 02:38:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:38:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:38:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863953276] [2024-10-11 02:38:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863953276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152975059] [2024-10-11 02:38:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:04,995 INFO L87 Difference]: Start difference. First operand has 556 states, 427 states have (on average 1.721311475409836) internal successors, (735), 447 states have internal predecessors, (735), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:12,349 INFO L93 Difference]: Finished difference Result 1387 states and 2433 transitions. [2024-10-11 02:38:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:12,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2024-10-11 02:38:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:12,381 INFO L225 Difference]: With dead ends: 1387 [2024-10-11 02:38:12,382 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 02:38:12,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:12,404 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1461 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 5500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:12,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 2604 Invalid, 5500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [380 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 02:38:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 02:38:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 562. [2024-10-11 02:38:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 433 states have (on average 1.7066974595842956) internal successors, (739), 453 states have internal predecessors, (739), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2024-10-11 02:38:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 944 transitions. [2024-10-11 02:38:12,644 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 944 transitions. Word has length 52 [2024-10-11 02:38:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:12,644 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 944 transitions. [2024-10-11 02:38:12,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 944 transitions. [2024-10-11 02:38:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:38:12,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:12,654 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:38:12,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash -485832071, now seen corresponding path program 1 times [2024-10-11 02:38:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119931174] [2024-10-11 02:38:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:38:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:13,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:13,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119931174] [2024-10-11 02:38:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119931174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:13,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971552002] [2024-10-11 02:38:13,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:13,347 INFO L87 Difference]: Start difference. First operand 562 states and 944 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:19,396 INFO L93 Difference]: Finished difference Result 1384 states and 2400 transitions. [2024-10-11 02:38:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-10-11 02:38:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:19,404 INFO L225 Difference]: With dead ends: 1384 [2024-10-11 02:38:19,404 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 02:38:19,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:38:19,408 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 851 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 5219 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 5417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 5219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:19,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 2283 Invalid, 5417 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [198 Valid, 5219 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 02:38:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 02:38:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 562. [2024-10-11 02:38:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 433 states have (on average 1.7043879907621247) internal successors, (738), 453 states have internal predecessors, (738), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2024-10-11 02:38:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 943 transitions. [2024-10-11 02:38:19,534 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 943 transitions. Word has length 53 [2024-10-11 02:38:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:19,535 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 943 transitions. [2024-10-11 02:38:19,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 943 transitions. [2024-10-11 02:38:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:38:19,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:19,538 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:19,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:38:19,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:19,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1166356715, now seen corresponding path program 1 times [2024-10-11 02:38:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798039512] [2024-10-11 02:38:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:38:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:38:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798039512] [2024-10-11 02:38:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798039512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:20,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:20,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:38:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605347339] [2024-10-11 02:38:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:20,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:38:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:38:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:38:20,146 INFO L87 Difference]: Start difference. First operand 562 states and 943 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:38:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:24,533 INFO L93 Difference]: Finished difference Result 1378 states and 2383 transitions. [2024-10-11 02:38:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:38:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-11 02:38:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:24,540 INFO L225 Difference]: With dead ends: 1378 [2024-10-11 02:38:24,540 INFO L226 Difference]: Without dead ends: 797 [2024-10-11 02:38:24,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:24,545 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1368 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:24,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1354 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:38:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-11 02:38:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 539. [2024-10-11 02:38:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 413 states have (on average 1.694915254237288) internal successors, (700), 431 states have internal predecessors, (700), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:38:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 901 transitions. [2024-10-11 02:38:24,664 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 901 transitions. Word has length 53 [2024-10-11 02:38:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 901 transitions. [2024-10-11 02:38:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:38:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 901 transitions. [2024-10-11 02:38:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:38:24,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:24,670 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:24,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:38:24,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash -834773185, now seen corresponding path program 1 times [2024-10-11 02:38:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704488295] [2024-10-11 02:38:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:38:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:38:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704488295] [2024-10-11 02:38:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704488295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:25,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412633646] [2024-10-11 02:38:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:25,343 INFO L87 Difference]: Start difference. First operand 539 states and 901 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:31,205 INFO L93 Difference]: Finished difference Result 1342 states and 2315 transitions. [2024-10-11 02:38:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:31,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-10-11 02:38:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:31,213 INFO L225 Difference]: With dead ends: 1342 [2024-10-11 02:38:31,213 INFO L226 Difference]: Without dead ends: 791 [2024-10-11 02:38:31,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:31,217 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1384 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 4948 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 5316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 4948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:31,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 2573 Invalid, 5316 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [368 Valid, 4948 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:38:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-11 02:38:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 533. [2024-10-11 02:38:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 407 states have (on average 1.6879606879606879) internal successors, (687), 425 states have internal predecessors, (687), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:38:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 888 transitions. [2024-10-11 02:38:31,308 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 888 transitions. Word has length 54 [2024-10-11 02:38:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:31,309 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 888 transitions. [2024-10-11 02:38:31,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 888 transitions. [2024-10-11 02:38:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:38:31,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:31,310 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:31,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:38:31,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:31,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash 996465169, now seen corresponding path program 1 times [2024-10-11 02:38:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052512495] [2024-10-11 02:38:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:38:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052512495] [2024-10-11 02:38:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052512495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:31,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821083678] [2024-10-11 02:38:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:31,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:31,916 INFO L87 Difference]: Start difference. First operand 533 states and 888 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:37,241 INFO L93 Difference]: Finished difference Result 1314 states and 2266 transitions. [2024-10-11 02:38:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:37,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2024-10-11 02:38:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:37,248 INFO L225 Difference]: With dead ends: 1314 [2024-10-11 02:38:37,248 INFO L226 Difference]: Without dead ends: 791 [2024-10-11 02:38:37,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:38:37,251 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1333 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 4846 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 5231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 4846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:37,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 2309 Invalid, 5231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 4846 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:38:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-11 02:38:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 533. [2024-10-11 02:38:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 407 states have (on average 1.6855036855036856) internal successors, (686), 425 states have internal predecessors, (686), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:38:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 887 transitions. [2024-10-11 02:38:37,338 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 887 transitions. Word has length 55 [2024-10-11 02:38:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:37,339 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 887 transitions. [2024-10-11 02:38:37,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 887 transitions. [2024-10-11 02:38:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:38:37,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:37,340 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:37,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:38:37,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:37,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2071618366, now seen corresponding path program 1 times [2024-10-11 02:38:37,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:37,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505922124] [2024-10-11 02:38:37,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:38:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505922124] [2024-10-11 02:38:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505922124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:37,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430809115] [2024-10-11 02:38:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:37,969 INFO L87 Difference]: Start difference. First operand 533 states and 887 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:43,895 INFO L93 Difference]: Finished difference Result 1330 states and 2284 transitions. [2024-10-11 02:38:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2024-10-11 02:38:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:43,902 INFO L225 Difference]: With dead ends: 1330 [2024-10-11 02:38:43,902 INFO L226 Difference]: Without dead ends: 785 [2024-10-11 02:38:43,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:43,906 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 822 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 4923 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 4923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:43,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2156 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 4923 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:38:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-11 02:38:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 527. [2024-10-11 02:38:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.6783042394014962) internal successors, (673), 419 states have internal predecessors, (673), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:38:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 874 transitions. [2024-10-11 02:38:43,997 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 874 transitions. Word has length 56 [2024-10-11 02:38:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:43,998 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 874 transitions. [2024-10-11 02:38:43,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 874 transitions. [2024-10-11 02:38:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:38:43,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:43,999 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:43,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:38:43,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:44,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash -630177936, now seen corresponding path program 1 times [2024-10-11 02:38:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923176393] [2024-10-11 02:38:44,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:38:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923176393] [2024-10-11 02:38:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923176393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:44,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492140625] [2024-10-11 02:38:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:44,578 INFO L87 Difference]: Start difference. First operand 527 states and 874 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:49,968 INFO L93 Difference]: Finished difference Result 1302 states and 2237 transitions. [2024-10-11 02:38:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-11 02:38:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:49,974 INFO L225 Difference]: With dead ends: 1302 [2024-10-11 02:38:49,974 INFO L226 Difference]: Without dead ends: 785 [2024-10-11 02:38:49,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:38:49,977 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 785 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 4888 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 5079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 4888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:49,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 2298 Invalid, 5079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 4888 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:38:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-11 02:38:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 527. [2024-10-11 02:38:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.6758104738154613) internal successors, (672), 419 states have internal predecessors, (672), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:38:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 873 transitions. [2024-10-11 02:38:50,069 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 873 transitions. Word has length 57 [2024-10-11 02:38:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:50,070 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 873 transitions. [2024-10-11 02:38:50,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 873 transitions. [2024-10-11 02:38:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:38:50,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:50,071 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:50,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:38:50,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:50,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash -901366434, now seen corresponding path program 1 times [2024-10-11 02:38:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050886984] [2024-10-11 02:38:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:50,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:38:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:50,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050886984] [2024-10-11 02:38:50,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050886984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:50,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:50,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864148087] [2024-10-11 02:38:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:50,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:50,596 INFO L87 Difference]: Start difference. First operand 527 states and 873 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:56,255 INFO L93 Difference]: Finished difference Result 1318 states and 2253 transitions. [2024-10-11 02:38:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:56,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 02:38:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:56,260 INFO L225 Difference]: With dead ends: 1318 [2024-10-11 02:38:56,261 INFO L226 Difference]: Without dead ends: 779 [2024-10-11 02:38:56,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:38:56,264 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 799 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 4811 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 4811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:56,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2118 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 4811 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:38:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-11 02:38:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 521. [2024-10-11 02:38:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 395 states have (on average 1.6683544303797468) internal successors, (659), 413 states have internal predecessors, (659), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:38:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 860 transitions. [2024-10-11 02:38:56,356 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 860 transitions. Word has length 58 [2024-10-11 02:38:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 860 transitions. [2024-10-11 02:38:56,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:38:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 860 transitions. [2024-10-11 02:38:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:38:56,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:56,360 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:56,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:38:56,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:56,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1246622047, now seen corresponding path program 1 times [2024-10-11 02:38:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:56,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291432793] [2024-10-11 02:38:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:38:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291432793] [2024-10-11 02:38:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291432793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398174068] [2024-10-11 02:38:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:56,901 INFO L87 Difference]: Start difference. First operand 521 states and 860 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:02,220 INFO L93 Difference]: Finished difference Result 1290 states and 2208 transitions. [2024-10-11 02:39:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 02:39:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:02,227 INFO L225 Difference]: With dead ends: 1290 [2024-10-11 02:39:02,227 INFO L226 Difference]: Without dead ends: 779 [2024-10-11 02:39:02,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:02,230 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 765 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 4936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:02,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 2298 Invalid, 4936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:39:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-11 02:39:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 521. [2024-10-11 02:39:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 395 states have (on average 1.6658227848101266) internal successors, (658), 413 states have internal predecessors, (658), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:39:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 859 transitions. [2024-10-11 02:39:02,345 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 859 transitions. Word has length 58 [2024-10-11 02:39:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:02,346 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 859 transitions. [2024-10-11 02:39:02,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 859 transitions. [2024-10-11 02:39:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:39:02,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:02,347 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:02,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:39:02,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1501438826, now seen corresponding path program 1 times [2024-10-11 02:39:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129883814] [2024-10-11 02:39:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:39:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129883814] [2024-10-11 02:39:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129883814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:02,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:02,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845185605] [2024-10-11 02:39:02,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:02,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:02,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:02,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:02,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:02,914 INFO L87 Difference]: Start difference. First operand 521 states and 859 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:39:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:06,854 INFO L93 Difference]: Finished difference Result 1296 states and 2212 transitions. [2024-10-11 02:39:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:39:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-11 02:39:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:06,860 INFO L225 Difference]: With dead ends: 1296 [2024-10-11 02:39:06,860 INFO L226 Difference]: Without dead ends: 785 [2024-10-11 02:39:06,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:06,862 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 755 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:06,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1175 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:39:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-11 02:39:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 527. [2024-10-11 02:39:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.655860349127182) internal successors, (664), 419 states have internal predecessors, (664), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:39:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 865 transitions. [2024-10-11 02:39:06,957 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 865 transitions. Word has length 59 [2024-10-11 02:39:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:06,957 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 865 transitions. [2024-10-11 02:39:06,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:39:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 865 transitions. [2024-10-11 02:39:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:39:06,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:06,958 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:39:06,959 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:06,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1524071080, now seen corresponding path program 1 times [2024-10-11 02:39:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841764403] [2024-10-11 02:39:06,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:39:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:39:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841764403] [2024-10-11 02:39:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841764403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:07,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102734461] [2024-10-11 02:39:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:07,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:07,513 INFO L87 Difference]: Start difference. First operand 527 states and 865 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:12,890 INFO L93 Difference]: Finished difference Result 1304 states and 2218 transitions. [2024-10-11 02:39:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:39:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 02:39:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:12,895 INFO L225 Difference]: With dead ends: 1304 [2024-10-11 02:39:12,895 INFO L226 Difference]: Without dead ends: 779 [2024-10-11 02:39:12,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:39:12,897 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 771 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 4711 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 4905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 4711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:12,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 2297 Invalid, 4905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 4711 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:39:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-11 02:39:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 521. [2024-10-11 02:39:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 395 states have (on average 1.6632911392405063) internal successors, (657), 413 states have internal predecessors, (657), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:39:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 858 transitions. [2024-10-11 02:39:12,994 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 858 transitions. Word has length 59 [2024-10-11 02:39:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:12,994 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 858 transitions. [2024-10-11 02:39:12,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 858 transitions. [2024-10-11 02:39:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:39:12,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:12,996 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:12,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:39:12,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:12,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1698462521, now seen corresponding path program 1 times [2024-10-11 02:39:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043893675] [2024-10-11 02:39:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:39:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:39:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043893675] [2024-10-11 02:39:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043893675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:39:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104918613] [2024-10-11 02:39:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:39:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:39:13,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:39:13,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:39:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:13,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:39:13,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:39:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:13,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:39:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104918613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:39:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:39:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472921655] [2024-10-11 02:39:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:13,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:39:13,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:39:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:13,854 INFO L87 Difference]: Start difference. First operand 521 states and 858 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:14,038 INFO L93 Difference]: Finished difference Result 1488 states and 2477 transitions. [2024-10-11 02:39:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:39:14,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-10-11 02:39:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:14,046 INFO L225 Difference]: With dead ends: 1488 [2024-10-11 02:39:14,046 INFO L226 Difference]: Without dead ends: 979 [2024-10-11 02:39:14,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:14,049 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 825 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:14,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1605 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:39:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-11 02:39:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 965. [2024-10-11 02:39:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 740 states have (on average 1.672972972972973) internal successors, (1238), 775 states have internal predecessors, (1238), 180 states have call successors, (180), 45 states have call predecessors, (180), 44 states have return successors, (182), 172 states have call predecessors, (182), 177 states have call successors, (182) [2024-10-11 02:39:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1600 transitions. [2024-10-11 02:39:14,192 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1600 transitions. Word has length 60 [2024-10-11 02:39:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:14,192 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1600 transitions. [2024-10-11 02:39:14,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1600 transitions. [2024-10-11 02:39:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:39:14,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:14,194 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:14,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:39:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 02:39:14,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1311393664, now seen corresponding path program 1 times [2024-10-11 02:39:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:14,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040412203] [2024-10-11 02:39:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:39:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:39:14,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040412203] [2024-10-11 02:39:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040412203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:39:14,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969686582] [2024-10-11 02:39:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:14,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:39:14,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:39:14,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:39:14,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:39:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:39:15,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:39:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:15,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:39:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969686582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:15,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:39:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:39:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475707131] [2024-10-11 02:39:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:15,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:39:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:39:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:15,246 INFO L87 Difference]: Start difference. First operand 965 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:15,518 INFO L93 Difference]: Finished difference Result 2376 states and 3963 transitions. [2024-10-11 02:39:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:39:15,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-11 02:39:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:15,527 INFO L225 Difference]: With dead ends: 2376 [2024-10-11 02:39:15,527 INFO L226 Difference]: Without dead ends: 1423 [2024-10-11 02:39:15,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:15,533 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 826 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:15,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1652 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:39:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-10-11 02:39:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1377. [2024-10-11 02:39:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1059 states have (on average 1.684608120868744) internal successors, (1784), 1111 states have internal predecessors, (1784), 255 states have call successors, (255), 62 states have call predecessors, (255), 62 states have return successors, (262), 245 states have call predecessors, (262), 252 states have call successors, (262) [2024-10-11 02:39:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2301 transitions. [2024-10-11 02:39:15,774 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2301 transitions. Word has length 61 [2024-10-11 02:39:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:15,775 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2301 transitions. [2024-10-11 02:39:15,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:39:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2301 transitions. [2024-10-11 02:39:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:39:15,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:15,776 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:15,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:39:15,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:39:15,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1357021890, now seen corresponding path program 1 times [2024-10-11 02:39:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547711497] [2024-10-11 02:39:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:39:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:39:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:39:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547711497] [2024-10-11 02:39:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547711497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:39:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329774111] [2024-10-11 02:39:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:16,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:39:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:39:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:39:16,484 INFO L87 Difference]: Start difference. First operand 1377 states and 2301 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)