./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_spec2_product09.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_spec2_product09.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 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:34:39,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:34:39,472 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:34:39,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:34:39,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:34:39,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:34:39,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:34:39,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:34:39,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:34:39,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:34:39,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:34:39,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:34:39,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:34:39,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:34:39,515 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:34:39,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:34:39,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:34:39,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:34:39,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:34:39,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:34:39,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:34:39,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:34:39,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:34:39,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:34:39,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:34:39,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:34:39,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:34:39,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:34:39,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:34:39,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:34:39,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:34:39,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:34:39,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:34:39,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:34:39,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:34:39,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:34:39,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:34:39,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:34:39,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:34:39,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:34:39,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:34:39,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:34:39,527 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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2024-10-11 02:34:39,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:34:39,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:34:39,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:34:39,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:34:39,783 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:34:39,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2024-10-11 02:34:41,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:34:41,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:34:41,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2024-10-11 02:34:41,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ec8a88ffc/d620bf368ff2448193f0a5e3e5e903e0/FLAG32953b166 [2024-10-11 02:34:41,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ec8a88ffc/d620bf368ff2448193f0a5e3e5e903e0 [2024-10-11 02:34:41,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:34:41,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:34:41,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:34:41,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:34:41,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:34:41,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:34:41" (1/1) ... [2024-10-11 02:34:41,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d065d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:41, skipping insertion in model container [2024-10-11 02:34:41,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:34:41" (1/1) ... [2024-10-11 02:34:41,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:34:42,275 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_spec2_product09.cil.c[28842,28855] [2024-10-11 02:34:42,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:34:42,464 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:34:42,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-11 02:34:42,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2024-10-11 02:34:42,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2024-10-11 02:34:42,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2024-10-11 02:34:42,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2024-10-11 02:34:42,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2024-10-11 02:34:42,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2024-10-11 02:34:42,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2024-10-11 02:34:42,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2024-10-11 02:34:42,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2024-10-11 02:34:42,522 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_spec2_product09.cil.c[28842,28855] [2024-10-11 02:34:42,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:34:42,601 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:34:42,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42 WrapperNode [2024-10-11 02:34:42,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:34:42,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:34:42,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:34:42,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:34:42,608 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:34:42" (1/1) ... [2024-10-11 02:34:42,629 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:34:42" (1/1) ... [2024-10-11 02:34:42,683 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 811 [2024-10-11 02:34:42,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:34:42,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:34:42,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:34:42,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:34:42,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,741 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:34:42,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:34:42,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:34:42,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:34:42,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:34:42,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (1/1) ... [2024-10-11 02:34:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:34:42,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:34:42,843 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:34:42,850 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:34:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:34:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:34:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:34:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:34:42,895 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:34:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:34:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:34:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:34:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:34:42,897 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:34:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:34:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:34:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:34:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:34:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:34:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:34:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:34:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:34:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:34:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:34:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:34:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:34:42,901 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:34:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:34:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:34:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:34:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:34:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:34:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:34:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:34:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:34:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:34:42,903 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:34:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:34:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:34:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:34:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:34:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:34:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:34:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:34:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:34:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:34:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:34:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:34:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:34:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:34:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:34:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:34:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:34:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:34:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:34:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:34:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:34:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:34:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:34:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:34:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:34:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:34:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:34:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:34:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:34:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:34:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:34:43,109 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:34:43,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:34:44,262 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2024-10-11 02:34:44,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:34:44,349 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:34:44,350 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:34:44,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:34:44 BoogieIcfgContainer [2024-10-11 02:34:44,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:34:44,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:34:44,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:34:44,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:34:44,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:34:41" (1/3) ... [2024-10-11 02:34:44,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d396e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:34:44, skipping insertion in model container [2024-10-11 02:34:44,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:42" (2/3) ... [2024-10-11 02:34:44,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d396e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:34:44, skipping insertion in model container [2024-10-11 02:34:44,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:34:44" (3/3) ... [2024-10-11 02:34:44,359 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2024-10-11 02:34:44,378 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:34:44,378 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:34:44,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:34:44,508 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;@1a8614a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:34:44,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:34:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 507 states, 399 states have (on average 1.7518796992481203) internal successors, (699), 420 states have internal predecessors, (699), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 02:34:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 02:34:44,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:34:44,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:34:44,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:34:44,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:34:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash -61166143, now seen corresponding path program 1 times [2024-10-11 02:34:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:34:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636207061] [2024-10-11 02:34:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:34:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:34:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:34:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:34:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:34:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:34:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:34:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:34:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:34:45,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636207061] [2024-10-11 02:34:45,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636207061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:34:45,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:34:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:34:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005010163] [2024-10-11 02:34:45,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:34:45,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:34:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:34:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:34:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:34:45,928 INFO L87 Difference]: Start difference. First operand has 507 states, 399 states have (on average 1.7518796992481203) internal successors, (699), 420 states have internal predecessors, (699), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:34:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:34:51,276 INFO L93 Difference]: Finished difference Result 1253 states and 2196 transitions. [2024-10-11 02:34:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:34:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-10-11 02:34:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:34:51,300 INFO L225 Difference]: With dead ends: 1253 [2024-10-11 02:34:51,301 INFO L226 Difference]: Without dead ends: 755 [2024-10-11 02:34:51,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:34:51,313 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1360 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:34:51,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 1618 Invalid, 3157 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [331 Valid, 2826 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:34:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-11 02:34:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 503. [2024-10-11 02:34:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 397 states have (on average 1.7405541561712847) internal successors, (691), 416 states have internal predecessors, (691), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 02:34:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 858 transitions. [2024-10-11 02:34:51,521 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 858 transitions. Word has length 65 [2024-10-11 02:34:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:34:51,522 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 858 transitions. [2024-10-11 02:34:51,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:34:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 858 transitions. [2024-10-11 02:34:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 02:34:51,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:34:51,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:34:51,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:34:51,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:34:51,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:34:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -830918567, now seen corresponding path program 1 times [2024-10-11 02:34:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:34:51,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795204482] [2024-10-11 02:34:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:34:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:34:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:34:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:34:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:34:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:34:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:34:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:34:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:34:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795204482] [2024-10-11 02:34:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795204482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:34:52,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:34:52,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:34:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132958810] [2024-10-11 02:34:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:34:52,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:34:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:34:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:34:52,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:34:52,252 INFO L87 Difference]: Start difference. First operand 503 states and 858 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:34:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:34:56,812 INFO L93 Difference]: Finished difference Result 1246 states and 2165 transitions. [2024-10-11 02:34:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:34:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2024-10-11 02:34:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:34:56,821 INFO L225 Difference]: With dead ends: 1246 [2024-10-11 02:34:56,822 INFO L226 Difference]: Without dead ends: 755 [2024-10-11 02:34:56,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:34:56,826 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1752 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 3215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:34:56,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 1573 Invalid, 3215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:34:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-11 02:34:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 503. [2024-10-11 02:34:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 397 states have (on average 1.7380352644836272) internal successors, (690), 416 states have internal predecessors, (690), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 02:34:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 857 transitions. [2024-10-11 02:34:56,942 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 857 transitions. Word has length 67 [2024-10-11 02:34:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:34:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 857 transitions. [2024-10-11 02:34:56,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:34:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 857 transitions. [2024-10-11 02:34:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:34:56,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:34:56,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:34:56,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:34:56,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:34:56,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:34:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1458797947, now seen corresponding path program 1 times [2024-10-11 02:34:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:34:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829027805] [2024-10-11 02:34:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:34:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:34:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:34:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:34:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:34:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:34:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:34:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:34:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:34:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829027805] [2024-10-11 02:34:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829027805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:34:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:34:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:34:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010615989] [2024-10-11 02:34:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:34:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:34:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:34:57,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:34:57,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:34:57,603 INFO L87 Difference]: Start difference. First operand 503 states and 857 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:01,939 INFO L93 Difference]: Finished difference Result 1246 states and 2164 transitions. [2024-10-11 02:35:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-10-11 02:35:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:01,946 INFO L225 Difference]: With dead ends: 1246 [2024-10-11 02:35:01,946 INFO L226 Difference]: Without dead ends: 755 [2024-10-11 02:35:01,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:01,951 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 948 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 3204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:01,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1674 Invalid, 3204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:35:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-11 02:35:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 503. [2024-10-11 02:35:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 397 states have (on average 1.7355163727959697) internal successors, (689), 416 states have internal predecessors, (689), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 02:35:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 856 transitions. [2024-10-11 02:35:02,048 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 856 transitions. Word has length 68 [2024-10-11 02:35:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:02,049 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 856 transitions. [2024-10-11 02:35:02,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 856 transitions. [2024-10-11 02:35:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 02:35:02,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:02,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:02,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:35:02,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:02,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -170786283, now seen corresponding path program 1 times [2024-10-11 02:35:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348918172] [2024-10-11 02:35:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:35:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:02,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:02,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348918172] [2024-10-11 02:35:02,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348918172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:02,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:02,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:02,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971169745] [2024-10-11 02:35:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:02,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:02,750 INFO L87 Difference]: Start difference. First operand 503 states and 856 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:07,237 INFO L93 Difference]: Finished difference Result 1246 states and 2163 transitions. [2024-10-11 02:35:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:07,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2024-10-11 02:35:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:07,244 INFO L225 Difference]: With dead ends: 1246 [2024-10-11 02:35:07,244 INFO L226 Difference]: Without dead ends: 755 [2024-10-11 02:35:07,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:07,250 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1343 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:07,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1618 Invalid, 3245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:35:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-11 02:35:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 503. [2024-10-11 02:35:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 397 states have (on average 1.7329974811083124) internal successors, (688), 416 states have internal predecessors, (688), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 02:35:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 855 transitions. [2024-10-11 02:35:07,347 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 855 transitions. Word has length 69 [2024-10-11 02:35:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:07,348 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 855 transitions. [2024-10-11 02:35:07,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 855 transitions. [2024-10-11 02:35:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 02:35:07,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:07,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:07,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:35:07,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1255358007, now seen corresponding path program 1 times [2024-10-11 02:35:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126802493] [2024-10-11 02:35:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:35:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:07,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126802493] [2024-10-11 02:35:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126802493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:07,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:07,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364786955] [2024-10-11 02:35:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:07,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:07,975 INFO L87 Difference]: Start difference. First operand 503 states and 855 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:12,133 INFO L93 Difference]: Finished difference Result 1246 states and 2162 transitions. [2024-10-11 02:35:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2024-10-11 02:35:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:12,139 INFO L225 Difference]: With dead ends: 1246 [2024-10-11 02:35:12,139 INFO L226 Difference]: Without dead ends: 755 [2024-10-11 02:35:12,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:12,142 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 944 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:12,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1677 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:35:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-11 02:35:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 503. [2024-10-11 02:35:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 397 states have (on average 1.730478589420655) internal successors, (687), 416 states have internal predecessors, (687), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 02:35:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 854 transitions. [2024-10-11 02:35:12,255 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 854 transitions. Word has length 70 [2024-10-11 02:35:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:12,256 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 854 transitions. [2024-10-11 02:35:12,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 854 transitions. [2024-10-11 02:35:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 02:35:12,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:12,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:12,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:35:12,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:12,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1375161391, now seen corresponding path program 1 times [2024-10-11 02:35:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:12,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471902938] [2024-10-11 02:35:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:35:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471902938] [2024-10-11 02:35:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471902938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:35:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541364481] [2024-10-11 02:35:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:35:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:35:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:12,996 INFO L87 Difference]: Start difference. First operand 503 states and 854 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:19,134 INFO L93 Difference]: Finished difference Result 1222 states and 2118 transitions. [2024-10-11 02:35:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:35:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-10-11 02:35:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:19,140 INFO L225 Difference]: With dead ends: 1222 [2024-10-11 02:35:19,141 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 02:35:19,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:35:19,144 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1022 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 5359 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 5569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 5359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:19,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2920 Invalid, 5569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 5359 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:35:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 02:35:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 507. [2024-10-11 02:35:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 400 states have (on average 1.7125) internal successors, (685), 419 states have internal predecessors, (685), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (83), 80 states have call predecessors, (83), 81 states have call successors, (83) [2024-10-11 02:35:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 854 transitions. [2024-10-11 02:35:19,250 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 854 transitions. Word has length 71 [2024-10-11 02:35:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:19,250 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 854 transitions. [2024-10-11 02:35:19,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:35:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 854 transitions. [2024-10-11 02:35:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:35:19,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:19,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:19,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:35:19,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:19,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash -996704504, now seen corresponding path program 1 times [2024-10-11 02:35:19,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:19,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116894141] [2024-10-11 02:35:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:35:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:19,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116894141] [2024-10-11 02:35:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116894141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:19,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 02:35:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874342585] [2024-10-11 02:35:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:19,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:35:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:35:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:35:19,994 INFO L87 Difference]: Start difference. First operand 507 states and 854 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 02:35:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:35,223 INFO L93 Difference]: Finished difference Result 2385 states and 4301 transitions. [2024-10-11 02:35:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 02:35:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 76 [2024-10-11 02:35:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:35,240 INFO L225 Difference]: With dead ends: 2385 [2024-10-11 02:35:35,240 INFO L226 Difference]: Without dead ends: 1938 [2024-10-11 02:35:35,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=484, Invalid=1868, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 02:35:35,246 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 4326 mSDsluCounter, 5850 mSDsCounter, 0 mSdLazyCounter, 10287 mSolverCounterSat, 1299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 6400 SdHoareTripleChecker+Invalid, 11586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1299 IncrementalHoareTripleChecker+Valid, 10287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:35,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 6400 Invalid, 11586 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1299 Valid, 10287 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-10-11 02:35:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2024-10-11 02:35:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1348. [2024-10-11 02:35:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1053 states have (on average 1.6799620132953466) internal successors, (1769), 1102 states have internal predecessors, (1769), 236 states have call successors, (236), 53 states have call predecessors, (236), 58 states have return successors, (272), 228 states have call predecessors, (272), 231 states have call successors, (272) [2024-10-11 02:35:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2277 transitions. [2024-10-11 02:35:35,571 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2277 transitions. Word has length 76 [2024-10-11 02:35:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:35,571 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2277 transitions. [2024-10-11 02:35:35,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 02:35:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2277 transitions. [2024-10-11 02:35:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:35:35,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:35,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:35,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:35:35,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:35,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash 211181966, now seen corresponding path program 1 times [2024-10-11 02:35:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569257087] [2024-10-11 02:35:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:35,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:35:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:35:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569257087] [2024-10-11 02:35:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569257087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:36,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:35:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834769487] [2024-10-11 02:35:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:35:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:35:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:35:36,264 INFO L87 Difference]: Start difference. First operand 1348 states and 2277 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:35:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:40,995 INFO L93 Difference]: Finished difference Result 3189 states and 5566 transitions. [2024-10-11 02:35:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:35:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2024-10-11 02:35:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:41,010 INFO L225 Difference]: With dead ends: 3189 [2024-10-11 02:35:41,010 INFO L226 Difference]: Without dead ends: 1897 [2024-10-11 02:35:41,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:35:41,018 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1805 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 4753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:41,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 2438 Invalid, 4753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 4301 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:35:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2024-10-11 02:35:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1354. [2024-10-11 02:35:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1059 states have (on average 1.6713881019830028) internal successors, (1770), 1108 states have internal predecessors, (1770), 236 states have call successors, (236), 53 states have call predecessors, (236), 58 states have return successors, (272), 228 states have call predecessors, (272), 231 states have call successors, (272) [2024-10-11 02:35:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2278 transitions. [2024-10-11 02:35:41,438 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2278 transitions. Word has length 83 [2024-10-11 02:35:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:41,439 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 2278 transitions. [2024-10-11 02:35:41,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:35:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2278 transitions. [2024-10-11 02:35:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 02:35:41,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:41,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:35:41,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:41,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:41,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1300466010, now seen corresponding path program 1 times [2024-10-11 02:35:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573165256] [2024-10-11 02:35:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:35:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:35:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:42,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:35:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573165256] [2024-10-11 02:35:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573165256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:42,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:42,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:35:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819366441] [2024-10-11 02:35:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:42,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:35:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:35:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:35:42,170 INFO L87 Difference]: Start difference. First operand 1354 states and 2278 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 02:35:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:52,892 INFO L93 Difference]: Finished difference Result 3519 states and 6180 transitions. [2024-10-11 02:35:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 02:35:52,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 87 [2024-10-11 02:35:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:52,908 INFO L225 Difference]: With dead ends: 3519 [2024-10-11 02:35:52,908 INFO L226 Difference]: Without dead ends: 2029 [2024-10-11 02:35:52,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 02:35:52,917 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 4560 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 7425 mSolverCounterSat, 1168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4625 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 8593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1168 IncrementalHoareTripleChecker+Valid, 7425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:52,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4625 Valid, 4180 Invalid, 8593 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1168 Valid, 7425 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-11 02:35:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-10-11 02:35:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1432. [2024-10-11 02:35:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1118 states have (on average 1.6359570661896243) internal successors, (1829), 1171 states have internal predecessors, (1829), 248 states have call successors, (248), 58 states have call predecessors, (248), 65 states have return successors, (296), 238 states have call predecessors, (296), 243 states have call successors, (296) [2024-10-11 02:35:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2373 transitions. [2024-10-11 02:35:53,276 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2373 transitions. Word has length 87 [2024-10-11 02:35:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:53,276 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2373 transitions. [2024-10-11 02:35:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 02:35:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2373 transitions. [2024-10-11 02:35:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:35:53,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:53,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:35:53,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -477462868, now seen corresponding path program 1 times [2024-10-11 02:35:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520964184] [2024-10-11 02:35:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:35:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:35:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:35:54,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520964184] [2024-10-11 02:35:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520964184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:54,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:54,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:35:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194496717] [2024-10-11 02:35:54,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:54,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:35:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:35:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:35:54,038 INFO L87 Difference]: Start difference. First operand 1432 states and 2373 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:36:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:01,043 INFO L93 Difference]: Finished difference Result 3501 states and 6117 transitions. [2024-10-11 02:36:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:36:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-10-11 02:36:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:01,057 INFO L225 Difference]: With dead ends: 3501 [2024-10-11 02:36:01,058 INFO L226 Difference]: Without dead ends: 2125 [2024-10-11 02:36:01,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:36:01,065 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1492 mSDsluCounter, 3607 mSDsCounter, 0 mSdLazyCounter, 6641 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 7034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 6641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:01,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 4088 Invalid, 7034 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 6641 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:36:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states.