./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_product17.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_product17.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 f4d752ef50871b3af82701ffcd8ca92c2975f63f8274731e1afbb137d2562986 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:34:47,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:34:47,784 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:47,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:34:47,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:34:47,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:34:47,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:34:47,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:34:47,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:34:47,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:34:47,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:34:47,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:34:47,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:34:47,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:34:47,816 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:34:47,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:34:47,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:34:47,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:34:47,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:34:47,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:34:47,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:34:47,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:34:47,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:34:47,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:34:47,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:34:47,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:34:47,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:34:47,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:34:47,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:34:47,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:34:47,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:34:47,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:34:47,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:34:47,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:34:47,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:34:47,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:34:47,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:34:47,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:34:47,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:34:47,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:34:47,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:34:47,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:34:47,826 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 -> f4d752ef50871b3af82701ffcd8ca92c2975f63f8274731e1afbb137d2562986 [2024-10-11 02:34:48,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:34:48,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:34:48,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:34:48,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:34:48,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:34:48,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product17.cil.c [2024-10-11 02:34:49,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:34:49,659 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:34:49,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product17.cil.c [2024-10-11 02:34:49,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60e85c052/2f6873fe17d64067b4924d0cdd19242d/FLAGdebdfe218 [2024-10-11 02:34:49,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60e85c052/2f6873fe17d64067b4924d0cdd19242d [2024-10-11 02:34:49,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:34:49,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:34:49,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:34:49,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:34:49,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:34:49,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:34:49" (1/1) ... [2024-10-11 02:34:49,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f03158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:49, skipping insertion in model container [2024-10-11 02:34:49,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:34:49" (1/1) ... [2024-10-11 02:34:49,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:34:50,256 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_product17.cil.c[17414,17427] [2024-10-11 02:34:50,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:34:50,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:34:50,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-11 02:34:50,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2024-10-11 02:34:50,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [725] [2024-10-11 02:34:50,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [846] [2024-10-11 02:34:50,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [884] [2024-10-11 02:34:50,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [983] [2024-10-11 02:34:50,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1337] [2024-10-11 02:34:50,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2786] [2024-10-11 02:34:50,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2967] [2024-10-11 02:34:50,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3333] [2024-10-11 02:34:50,570 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_product17.cil.c[17414,17427] [2024-10-11 02:34:50,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:34:50,687 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:34:50,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:50 WrapperNode [2024-10-11 02:34:50,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:34:50,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:34:50,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:34:50,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:34:50,695 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:50" (1/1) ... [2024-10-11 02:34:50,724 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:50" (1/1) ... [2024-10-11 02:34:50,761 INFO L138 Inliner]: procedures = 90, calls = 332, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 801 [2024-10-11 02:34:50,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:34:50,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:34:50,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:34:50,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:34:50,776 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:50" (1/1) ... [2024-10-11 02:34:50,778 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:50" (1/1) ... [2024-10-11 02:34:50,781 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:50" (1/1) ... [2024-10-11 02:34:50,815 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:50,816 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:50" (1/1) ... [2024-10-11 02:34:50,816 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:50" (1/1) ... [2024-10-11 02:34:50,835 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:50" (1/1) ... [2024-10-11 02:34:50,853 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:50" (1/1) ... [2024-10-11 02:34:50,861 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:50" (1/1) ... [2024-10-11 02:34:50,869 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:50" (1/1) ... [2024-10-11 02:34:50,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:34:50,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:34:50,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:34:50,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:34:50,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:50" (1/1) ... [2024-10-11 02:34:50,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:34:50,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:34:50,920 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:50,923 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:50,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:34:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:34:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:34:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:34:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:34:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:34:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:34:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:34:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:34:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:34:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:34:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:34:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:34:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:34:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:34:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:34:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:34:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:34:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:34:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:34:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:34:51,124 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:34:51,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:34:52,046 INFO L? ?]: Removed 427 outVars from TransFormulas that were not future-live. [2024-10-11 02:34:52,046 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:34:52,139 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:34:52,139 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:34:52,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:34:52 BoogieIcfgContainer [2024-10-11 02:34:52,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:34:52,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:34:52,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:34:52,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:34:52,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:34:49" (1/3) ... [2024-10-11 02:34:52,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b412695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:34:52, skipping insertion in model container [2024-10-11 02:34:52,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:50" (2/3) ... [2024-10-11 02:34:52,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b412695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:34:52, skipping insertion in model container [2024-10-11 02:34:52,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:34:52" (3/3) ... [2024-10-11 02:34:52,148 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2024-10-11 02:34:52,163 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:34:52,164 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:34:52,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:34:52,252 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;@488c64fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:34:52,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:34:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 400 states have (on average 1.7475) internal successors, (699), 421 states have internal predecessors, (699), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 02:34:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 02:34:52,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:34:52,279 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:52,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:34:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:34:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2069480681, now seen corresponding path program 1 times [2024-10-11 02:34:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:34:52,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455705931] [2024-10-11 02:34:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:34:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:34:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:34:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:34:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:34:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:53,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:34:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:34:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:53,346 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:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:34:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455705931] [2024-10-11 02:34:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455705931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:34:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:34:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:34:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801340001] [2024-10-11 02:34:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:34:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:34:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:34:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:34:53,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:34:53,373 INFO L87 Difference]: Start difference. First operand has 511 states, 400 states have (on average 1.7475) internal successors, (699), 421 states have internal predecessors, (699), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) 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:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:34:57,615 INFO L93 Difference]: Finished difference Result 1254 states and 2176 transitions. [2024-10-11 02:34:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:34:57,617 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:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:34:57,637 INFO L225 Difference]: With dead ends: 1254 [2024-10-11 02:34:57,637 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:34:57,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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:57,647 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1757 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:34:57,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 1583 Invalid, 3126 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [472 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:34:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:34:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 507. [2024-10-11 02:34:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 398 states have (on average 1.736180904522613) internal successors, (691), 417 states have internal predecessors, (691), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-11 02:34:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 862 transitions. [2024-10-11 02:34:57,815 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 862 transitions. Word has length 65 [2024-10-11 02:34:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:34:57,816 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 862 transitions. [2024-10-11 02:34:57,817 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:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 862 transitions. [2024-10-11 02:34:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 02:34:57,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:34:57,824 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:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:34:57,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:34:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:34:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash 587764296, now seen corresponding path program 1 times [2024-10-11 02:34:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:34:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378009081] [2024-10-11 02:34:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:34:57,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:34:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:34:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:34:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:34:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:34:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:34:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:34:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:34:58,405 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:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:34:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378009081] [2024-10-11 02:34:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378009081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:34:58,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:34:58,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:34:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339744564] [2024-10-11 02:34:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:34:58,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:34:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:34:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:34:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:34:58,412 INFO L87 Difference]: Start difference. First operand 507 states and 862 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:35:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:02,136 INFO L93 Difference]: Finished difference Result 1247 states and 2145 transitions. [2024-10-11 02:35:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:02,136 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:35:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:02,143 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 02:35:02,143 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:35:02,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:02,147 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1745 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:02,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 1581 Invalid, 3119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2657 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:35:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:35:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 507. [2024-10-11 02:35:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 398 states have (on average 1.7336683417085428) internal successors, (690), 417 states have internal predecessors, (690), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-11 02:35:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 861 transitions. [2024-10-11 02:35:02,252 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 861 transitions. Word has length 67 [2024-10-11 02:35:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 861 transitions. [2024-10-11 02:35:02,253 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:35:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 861 transitions. [2024-10-11 02:35:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:35:02,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:02,255 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:35:02,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:35:02,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:02,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -870118260, now seen corresponding path program 1 times [2024-10-11 02:35:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148883709] [2024-10-11 02:35:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:35:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:02,717 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,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148883709] [2024-10-11 02:35:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148883709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874538926] [2024-10-11 02:35:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:02,720 INFO L87 Difference]: Start difference. First operand 507 states and 861 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:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:06,200 INFO L93 Difference]: Finished difference Result 1247 states and 2144 transitions. [2024-10-11 02:35:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:06,200 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:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:06,206 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 02:35:06,206 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:35:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:06,209 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1337 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:06,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 1628 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:35:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:35:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 507. [2024-10-11 02:35:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 398 states have (on average 1.7311557788944723) internal successors, (689), 417 states have internal predecessors, (689), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-11 02:35:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 860 transitions. [2024-10-11 02:35:06,291 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 860 transitions. Word has length 68 [2024-10-11 02:35:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:06,291 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 860 transitions. [2024-10-11 02:35:06,291 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:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 860 transitions. [2024-10-11 02:35:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 02:35:06,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:06,293 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:06,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:35:06,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:06,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1583810628, now seen corresponding path program 1 times [2024-10-11 02:35:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440048068] [2024-10-11 02:35:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:35:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:06,778 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:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440048068] [2024-10-11 02:35:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440048068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533306066] [2024-10-11 02:35:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:06,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:06,781 INFO L87 Difference]: Start difference. First operand 507 states and 860 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:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:10,617 INFO L93 Difference]: Finished difference Result 1247 states and 2143 transitions. [2024-10-11 02:35:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:10,617 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:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:10,623 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 02:35:10,623 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:35:10,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:10,629 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 917 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:10,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1666 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:35:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:35:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 507. [2024-10-11 02:35:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 398 states have (on average 1.728643216080402) internal successors, (688), 417 states have internal predecessors, (688), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-11 02:35:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 859 transitions. [2024-10-11 02:35:10,704 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 859 transitions. Word has length 69 [2024-10-11 02:35:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:10,706 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 859 transitions. [2024-10-11 02:35:10,706 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:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 859 transitions. [2024-10-11 02:35:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 02:35:10,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:10,709 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:10,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:35:10,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:10,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 749842696, now seen corresponding path program 1 times [2024-10-11 02:35:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867611232] [2024-10-11 02:35:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:10,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:10,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:35:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:11,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:11,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:11,209 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:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867611232] [2024-10-11 02:35:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867611232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241052358] [2024-10-11 02:35:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:11,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:11,213 INFO L87 Difference]: Start difference. First operand 507 states and 859 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:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:14,501 INFO L93 Difference]: Finished difference Result 1247 states and 2142 transitions. [2024-10-11 02:35:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:35:14,501 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:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:14,506 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 02:35:14,506 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:35:14,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:14,508 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1747 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:14,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 1556 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:35:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:35:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 507. [2024-10-11 02:35:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 398 states have (on average 1.7261306532663316) internal successors, (687), 417 states have internal predecessors, (687), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-11 02:35:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 858 transitions. [2024-10-11 02:35:14,588 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 858 transitions. Word has length 70 [2024-10-11 02:35:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 858 transitions. [2024-10-11 02:35:14,589 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:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 858 transitions. [2024-10-11 02:35:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 02:35:14,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:14,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] [2024-10-11 02:35:14,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:35:14,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:14,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1171200415, now seen corresponding path program 1 times [2024-10-11 02:35:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381591011] [2024-10-11 02:35:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:35:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:35:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:15,112 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:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:15,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381591011] [2024-10-11 02:35:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381591011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:35:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806457402] [2024-10-11 02:35:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:15,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:35:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:15,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:35:15,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:15,115 INFO L87 Difference]: Start difference. First operand 507 states and 858 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,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:19,893 INFO L93 Difference]: Finished difference Result 1223 states and 2098 transitions. [2024-10-11 02:35:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:35:19,894 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,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:19,898 INFO L225 Difference]: With dead ends: 1223 [2024-10-11 02:35:19,898 INFO L226 Difference]: Without dead ends: 768 [2024-10-11 02:35:19,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:35:19,900 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1401 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 5082 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 5434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 5082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:19,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2894 Invalid, 5434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 5082 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:35:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-11 02:35:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 511. [2024-10-11 02:35:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 401 states have (on average 1.7082294264339153) internal successors, (685), 420 states have internal predecessors, (685), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (85), 82 states have call predecessors, (85), 83 states have call successors, (85) [2024-10-11 02:35:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 858 transitions. [2024-10-11 02:35:19,972 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 858 transitions. Word has length 71 [2024-10-11 02:35:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:19,973 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 858 transitions. [2024-10-11 02:35:19,973 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,973 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 858 transitions. [2024-10-11 02:35:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:35:19,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:19,976 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,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:35:19,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -301402222, now seen corresponding path program 1 times [2024-10-11 02:35:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722423489] [2024-10-11 02:35:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:35:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:20,486 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:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722423489] [2024-10-11 02:35:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722423489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:35:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154633636] [2024-10-11 02:35:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:35:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:20,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:35:20,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:35:20,488 INFO L87 Difference]: Start difference. First operand 511 states and 858 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:35:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:30,033 INFO L93 Difference]: Finished difference Result 2358 states and 4195 transitions. [2024-10-11 02:35:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 02:35:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-11 02:35:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:30,049 INFO L225 Difference]: With dead ends: 2358 [2024-10-11 02:35:30,049 INFO L226 Difference]: Without dead ends: 1899 [2024-10-11 02:35:30,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:35:30,055 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 4327 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 6329 mSolverCounterSat, 1382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4405 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 7711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1382 IncrementalHoareTripleChecker+Valid, 6329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:30,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4405 Valid, 3878 Invalid, 7711 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1382 Valid, 6329 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 02:35:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-10-11 02:35:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1348. [2024-10-11 02:35:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1047 states have (on average 1.6714422158548232) internal successors, (1750), 1094 states have internal predecessors, (1750), 241 states have call successors, (241), 56 states have call predecessors, (241), 59 states have return successors, (275), 233 states have call predecessors, (275), 236 states have call successors, (275) [2024-10-11 02:35:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2266 transitions. [2024-10-11 02:35:30,337 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2266 transitions. Word has length 76 [2024-10-11 02:35:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:30,337 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2266 transitions. [2024-10-11 02:35:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:35:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2266 transitions. [2024-10-11 02:35:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:35:30,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:30,341 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] [2024-10-11 02:35:30,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:35:30,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:30,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1514271691, now seen corresponding path program 1 times [2024-10-11 02:35:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726189836] [2024-10-11 02:35:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:35:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:35:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:35:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:30,918 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:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726189836] [2024-10-11 02:35:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726189836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:30,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:35:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363657936] [2024-10-11 02:35:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:35:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:35:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:35:30,920 INFO L87 Difference]: Start difference. First operand 1348 states and 2266 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:35,151 INFO L93 Difference]: Finished difference Result 3164 states and 5455 transitions. [2024-10-11 02:35:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:35:35,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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 84 [2024-10-11 02:35:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:35,162 INFO L225 Difference]: With dead ends: 3164 [2024-10-11 02:35:35,162 INFO L226 Difference]: Without dead ends: 1868 [2024-10-11 02:35:35,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:35:35,168 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1409 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 4120 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 4467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 4120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:35,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 2445 Invalid, 4467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 4120 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:35:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-10-11 02:35:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1354. [2024-10-11 02:35:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1053 states have (on average 1.6628679962013295) internal successors, (1751), 1100 states have internal predecessors, (1751), 241 states have call successors, (241), 56 states have call predecessors, (241), 59 states have return successors, (275), 233 states have call predecessors, (275), 236 states have call successors, (275) [2024-10-11 02:35:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2267 transitions. [2024-10-11 02:35:35,437 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2267 transitions. Word has length 84 [2024-10-11 02:35:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:35,437 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 2267 transitions. [2024-10-11 02:35:35,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2267 transitions. [2024-10-11 02:35:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:35:35,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:35,439 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, 1] [2024-10-11 02:35:35,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:35:35,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:35,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1273019233, now seen corresponding path program 1 times [2024-10-11 02:35:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:35,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175136239] [2024-10-11 02:35:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:35:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:35:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:35,922 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:35,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:35,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175136239] [2024-10-11 02:35:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175136239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:35:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565048397] [2024-10-11 02:35:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:35,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:35:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:35,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:35:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:35,925 INFO L87 Difference]: Start difference. First operand 1354 states and 2267 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:35:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:40,853 INFO L93 Difference]: Finished difference Result 3166 states and 5425 transitions. [2024-10-11 02:35:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:35:40,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 88 [2024-10-11 02:35:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:40,865 INFO L225 Difference]: With dead ends: 3166 [2024-10-11 02:35:40,865 INFO L226 Difference]: Without dead ends: 1870 [2024-10-11 02:35:40,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:35:40,871 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 955 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 4936 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 5143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 4936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:40,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2967 Invalid, 5143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 4936 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:35:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-10-11 02:35:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1356. [2024-10-11 02:35:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1055 states have (on average 1.6616113744075829) internal successors, (1753), 1102 states have internal predecessors, (1753), 241 states have call successors, (241), 56 states have call predecessors, (241), 59 states have return successors, (275), 233 states have call predecessors, (275), 236 states have call successors, (275) [2024-10-11 02:35:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 2269 transitions. [2024-10-11 02:35:41,107 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 2269 transitions. Word has length 88 [2024-10-11 02:35:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:41,107 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 2269 transitions. [2024-10-11 02:35:41,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:35:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2269 transitions. [2024-10-11 02:35:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:35:41,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:41,109 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, 1] [2024-10-11 02:35:41,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:35:41,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:41,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash 718449918, now seen corresponding path program 1 times [2024-10-11 02:35:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:41,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885521229] [2024-10-11 02:35:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:41,605 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 14 [2024-10-11 02:35:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:35:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:41,675 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:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885521229] [2024-10-11 02:35:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885521229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:35:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193682729] [2024-10-11 02:35:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:41,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:35:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:35:41,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:35:41,677 INFO L87 Difference]: Start difference. First operand 1356 states and 2269 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:35:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:46,337 INFO L93 Difference]: Finished difference Result 3351 states and 5847 transitions. [2024-10-11 02:35:46,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:35:46,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 88 [2024-10-11 02:35:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:46,349 INFO L225 Difference]: With dead ends: 3351 [2024-10-11 02:35:46,349 INFO L226 Difference]: Without dead ends: 1890 [2024-10-11 02:35:46,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:35:46,356 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 2623 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 4635 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 5226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 4635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:46,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 2859 Invalid, 5226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 4635 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:35:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-10-11 02:35:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1356. [2024-10-11 02:35:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1055 states have (on average 1.6407582938388625) internal successors, (1731), 1102 states have internal predecessors, (1731), 241 states have call successors, (241), 56 states have call predecessors, (241), 59 states have return successors, (275), 233 states have call predecessors, (275), 236 states have call successors, (275) [2024-10-11 02:35:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 2247 transitions. [2024-10-11 02:35:46,621 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 2247 transitions. Word has length 88 [2024-10-11 02:35:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:46,622 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 2247 transitions. [2024-10-11 02:35:46,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:35:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2247 transitions. [2024-10-11 02:35:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:35:46,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:46,624 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, 1] [2024-10-11 02:35:46,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:35:46,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:46,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash -919225602, now seen corresponding path program 1 times [2024-10-11 02:35:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838515620] [2024-10-11 02:35:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:35:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:35:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:35:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838515620] [2024-10-11 02:35:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838515620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:47,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:35:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185679323] [2024-10-11 02:35:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:47,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:35:47,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:35:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:35:47,103 INFO L87 Difference]: Start difference. First operand 1356 states and 2247 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:35:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:52,129 INFO L93 Difference]: Finished difference Result 3172 states and 5392 transitions. [2024-10-11 02:35:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:35:52,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-10-11 02:35:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:52,139 INFO L225 Difference]: With dead ends: 3172 [2024-10-11 02:35:52,140 INFO L226 Difference]: Without dead ends: 1876 [2024-10-11 02:35:52,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:35:52,145 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 939 mSDsluCounter, 2542 mSDsCounter, 0 mSdLazyCounter, 4881 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 5084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 4881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:52,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 2987 Invalid, 5084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 4881 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:35:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-10-11 02:35:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1359. [2024-10-11 02:35:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1058 states have (on average 1.6389413988657846) internal successors, (1734), 1105 states have internal predecessors, (1734), 241 states have call successors, (241), 56 states have call predecessors, (241), 59 states have return successors, (275), 233 states have call predecessors, (275), 236 states have call successors, (275) [2024-10-11 02:35:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2250 transitions. [2024-10-11 02:35:52,420 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2250 transitions. Word has length 92 [2024-10-11 02:35:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:52,421 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2250 transitions. [2024-10-11 02:35:52,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:35:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2250 transitions. [2024-10-11 02:35:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:35:52,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:52,424 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, 1] [2024-10-11 02:35:52,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:35:52,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:52,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash -972118501, now seen corresponding path program 1 times [2024-10-11 02:35:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779448388] [2024-10-11 02:35:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:35:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:35:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:35:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:52,961 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:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779448388] [2024-10-11 02:35:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779448388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:35:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838324438] [2024-10-11 02:35:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:52,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:35:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:35:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:35:52,963 INFO L87 Difference]: Start difference. First operand 1359 states and 2250 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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:35:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:59,037 INFO L93 Difference]: Finished difference Result 3303 states and 5714 transitions. [2024-10-11 02:35:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:35:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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 92 [2024-10-11 02:35:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:59,052 INFO L225 Difference]: With dead ends: 3303 [2024-10-11 02:35:59,052 INFO L226 Difference]: Without dead ends: 1996 [2024-10-11 02:35:59,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:35:59,059 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 1058 mSDsluCounter, 3725 mSDsCounter, 0 mSdLazyCounter, 6517 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 6763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 6517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:59,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 4216 Invalid, 6763 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [246 Valid, 6517 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:35:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2024-10-11 02:35:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1379. [2024-10-11 02:35:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1068 states have (on average 1.6282771535580525) internal successors, (1739), 1122 states have internal predecessors, (1739), 244 states have call successors, (244), 56 states have call predecessors, (244), 66 states have return successors, (307), 236 states have call predecessors, (307), 239 states have call successors, (307) [2024-10-11 02:35:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2290 transitions. [2024-10-11 02:35:59,365 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2290 transitions. Word has length 92 [2024-10-11 02:35:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:59,366 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2290 transitions. [2024-10-11 02:35:59,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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:35:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2290 transitions. [2024-10-11 02:35:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:35:59,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:59,368 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, 1, 1] [2024-10-11 02:35:59,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:35:59,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash -827305778, now seen corresponding path program 1 times [2024-10-11 02:35:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275723074] [2024-10-11 02:35:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:35:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:35:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:35:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:35:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:35:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:35:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275723074] [2024-10-11 02:35:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275723074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:35:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982576876] [2024-10-11 02:35:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:59,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:35:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:35:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:35:59,809 INFO L87 Difference]: Start difference. First operand 1379 states and 2290 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:03,743 INFO L93 Difference]: Finished difference Result 3218 states and 5512 transitions. [2024-10-11 02:36:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:36:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-11 02:36:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:03,757 INFO L225 Difference]: With dead ends: 3218 [2024-10-11 02:36:03,757 INFO L226 Difference]: Without dead ends: 1902 [2024-10-11 02:36:03,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:36:03,764 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 924 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:03,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1663 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-10-11 02:36:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1383. [2024-10-11 02:36:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1072 states have (on average 1.6259328358208955) internal successors, (1743), 1126 states have internal predecessors, (1743), 244 states have call successors, (244), 56 states have call predecessors, (244), 66 states have return successors, (307), 236 states have call predecessors, (307), 239 states have call successors, (307) [2024-10-11 02:36:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2294 transitions. [2024-10-11 02:36:04,097 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2294 transitions. Word has length 93 [2024-10-11 02:36:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:04,097 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2294 transitions. [2024-10-11 02:36:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2294 transitions. [2024-10-11 02:36:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:36:04,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:04,100 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, 1, 1] [2024-10-11 02:36:04,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:36:04,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -737179441, now seen corresponding path program 1 times [2024-10-11 02:36:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36840855] [2024-10-11 02:36:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:36:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:36:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:36:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:36:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36840855] [2024-10-11 02:36:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36840855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47822496] [2024-10-11 02:36:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:04,549 INFO L87 Difference]: Start difference. First operand 1383 states and 2294 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:08,228 INFO L93 Difference]: Finished difference Result 3273 states and 5580 transitions. [2024-10-11 02:36:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:36:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-11 02:36:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:08,241 INFO L225 Difference]: With dead ends: 3273 [2024-10-11 02:36:08,241 INFO L226 Difference]: Without dead ends: 1902 [2024-10-11 02:36:08,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:08,247 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1280 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:08,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 1640 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:36:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-10-11 02:36:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1383. [2024-10-11 02:36:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1072 states have (on average 1.625) internal successors, (1742), 1126 states have internal predecessors, (1742), 244 states have call successors, (244), 56 states have call predecessors, (244), 66 states have return successors, (307), 236 states have call predecessors, (307), 239 states have call successors, (307) [2024-10-11 02:36:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2293 transitions. [2024-10-11 02:36:08,561 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2293 transitions. Word has length 93 [2024-10-11 02:36:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:08,561 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2293 transitions. [2024-10-11 02:36:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:36:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2293 transitions. [2024-10-11 02:36:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:36:08,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:08,564 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, 1, 1] [2024-10-11 02:36:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:36:08,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1520558416, now seen corresponding path program 1 times [2024-10-11 02:36:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47593807] [2024-10-11 02:36:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:08,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:36:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:36:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:36:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:36:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47593807] [2024-10-11 02:36:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47593807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:36:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327848180] [2024-10-11 02:36:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:36:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:36:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:09,097 INFO L87 Difference]: Start difference. First operand 1383 states and 2293 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:36:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:13,888 INFO L93 Difference]: Finished difference Result 3228 states and 5523 transitions. [2024-10-11 02:36:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:36:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2024-10-11 02:36:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:13,899 INFO L225 Difference]: With dead ends: 3228 [2024-10-11 02:36:13,899 INFO L226 Difference]: Without dead ends: 1892 [2024-10-11 02:36:13,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:36:13,904 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1750 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 5126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:13,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 2842 Invalid, 5126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:36:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2024-10-11 02:36:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1375. [2024-10-11 02:36:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1064 states have (on average 1.6268796992481203) internal successors, (1731), 1118 states have internal predecessors, (1731), 244 states have call successors, (244), 56 states have call predecessors, (244), 66 states have return successors, (307), 236 states have call predecessors, (307), 239 states have call successors, (307) [2024-10-11 02:36:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2282 transitions. [2024-10-11 02:36:14,192 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2282 transitions. Word has length 93 [2024-10-11 02:36:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:14,192 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2282 transitions. [2024-10-11 02:36:14,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:36:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2282 transitions. [2024-10-11 02:36:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:36:14,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:14,195 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, 1, 1, 1] [2024-10-11 02:36:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:36:14,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -880101993, now seen corresponding path program 1 times [2024-10-11 02:36:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316344547] [2024-10-11 02:36:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:36:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:36:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:36:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:36:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:36:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316344547] [2024-10-11 02:36:14,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316344547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:14,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:36:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781261633] [2024-10-11 02:36:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:14,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:36:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:36:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:14,672 INFO L87 Difference]: Start difference. First operand 1375 states and 2282 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)