./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:36:52,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:36:52,649 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:36:52,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:36:52,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:36:52,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:36:52,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:36:52,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:36:52,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:36:52,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:36:52,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:36:52,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:36:52,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:36:52,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:36:52,685 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:36:52,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:36:52,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:36:52,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:36:52,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:36:52,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:36:52,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:36:52,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:36:52,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:36:52,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:36:52,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:36:52,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:36:52,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:36:52,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:36:52,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:36:52,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:36:52,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:36:52,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:36:52,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:36:52,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:36:52,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:36:52,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:36:52,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:36:52,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:36:52,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:36:52,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:36:52,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:36:52,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:36:52,695 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 -> 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 [2024-10-11 02:36:52,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:36:52,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:36:52,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:36:52,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:36:52,941 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:36:52,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2024-10-11 02:36:54,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:36:54,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:36:54,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2024-10-11 02:36:54,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27f8d8a37/ec94476cd9ec4ab5b605379c12147a49/FLAG5532a8ac5 [2024-10-11 02:36:54,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27f8d8a37/ec94476cd9ec4ab5b605379c12147a49 [2024-10-11 02:36:54,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:36:54,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:36:54,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:36:54,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:36:54,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:36:54,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:36:54" (1/1) ... [2024-10-11 02:36:54,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149c6956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:54, skipping insertion in model container [2024-10-11 02:36:54,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:36:54" (1/1) ... [2024-10-11 02:36:54,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:36:55,207 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c[21710,21723] [2024-10-11 02:36:55,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:36:55,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:36:55,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2024-10-11 02:36:55,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [147] [2024-10-11 02:36:55,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [165] [2024-10-11 02:36:55,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [832] [2024-10-11 02:36:55,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [952] [2024-10-11 02:36:55,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [961] [2024-10-11 02:36:55,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2404] [2024-10-11 02:36:55,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2442] [2024-10-11 02:36:55,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2790] [2024-10-11 02:36:55,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2976] [2024-10-11 02:36:55,386 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c[21710,21723] [2024-10-11 02:36:55,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:36:55,462 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:36:55,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55 WrapperNode [2024-10-11 02:36:55,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:36:55,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:36:55,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:36:55,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:36:55,469 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:36:55" (1/1) ... [2024-10-11 02:36:55,488 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:36:55" (1/1) ... [2024-10-11 02:36:55,526 INFO L138 Inliner]: procedures = 87, calls = 336, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 807 [2024-10-11 02:36:55,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:36:55,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:36:55,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:36:55,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:36:55,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,560 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:36:55,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:36:55,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:36:55,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:36:55,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:36:55,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (1/1) ... [2024-10-11 02:36:55,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:36:55,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:36:55,642 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:36:55,649 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:36:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:36:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:36:55,691 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:36:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:36:55,691 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:36:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:36:55,691 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:36:55,691 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:36:55,692 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:36:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:36:55,692 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:36:55,692 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:36:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:36:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:36:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:36:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:36:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:36:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:36:55,694 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:36:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:36:55,694 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:36:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:36:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:36:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:36:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:36:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:36:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:36:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:36:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:36:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:36:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:36:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:36:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:36:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:36:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:36:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:36:55,697 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:36:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:36:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:36:55,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:36:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:36:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:36:55,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:36:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:36:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:36:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:36:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:36:55,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:36:55,700 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:36:55,700 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:36:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:36:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:36:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:36:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:36:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:36:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:36:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:36:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:36:55,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:36:55,852 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:36:55,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:36:56,732 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2024-10-11 02:36:56,732 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:36:56,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:36:56,838 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:36:56,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:36:56 BoogieIcfgContainer [2024-10-11 02:36:56,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:36:56,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:36:56,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:36:56,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:36:56,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:36:54" (1/3) ... [2024-10-11 02:36:56,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a397885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:36:56, skipping insertion in model container [2024-10-11 02:36:56,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:55" (2/3) ... [2024-10-11 02:36:56,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a397885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:36:56, skipping insertion in model container [2024-10-11 02:36:56,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:36:56" (3/3) ... [2024-10-11 02:36:56,850 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product09.cil.c [2024-10-11 02:36:56,876 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:36:56,880 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:36:56,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:36:56,994 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;@14ea4983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:36:56,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:36:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 536 states, 413 states have (on average 1.7263922518159807) internal successors, (713), 431 states have internal predecessors, (713), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:36:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 02:36:57,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:57,020 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:57,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:57,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1944334352, now seen corresponding path program 1 times [2024-10-11 02:36:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:57,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277245942] [2024-10-11 02:36:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:57,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:36:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:36:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:36:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:36:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:36:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:36:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277245942] [2024-10-11 02:36:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277245942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:58,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:36:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387223381] [2024-10-11 02:36:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:36:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:36:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:58,089 INFO L87 Difference]: Start difference. First operand has 536 states, 413 states have (on average 1.7263922518159807) internal successors, (713), 431 states have internal predecessors, (713), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:04,851 INFO L93 Difference]: Finished difference Result 1415 states and 2503 transitions. [2024-10-11 02:37:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:04,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2024-10-11 02:37:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:04,882 INFO L225 Difference]: With dead ends: 1415 [2024-10-11 02:37:04,882 INFO L226 Difference]: Without dead ends: 876 [2024-10-11 02:37:04,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:04,898 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 1658 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 5431 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 5864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 5431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:04,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 2851 Invalid, 5864 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [433 Valid, 5431 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 02:37:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-11 02:37:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 542. [2024-10-11 02:37:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 437 states have internal predecessors, (717), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2024-10-11 02:37:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 914 transitions. [2024-10-11 02:37:05,113 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 914 transitions. Word has length 75 [2024-10-11 02:37:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:05,113 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 914 transitions. [2024-10-11 02:37:05,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 914 transitions. [2024-10-11 02:37:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:37:05,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:05,119 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:37:05,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1775703688, now seen corresponding path program 1 times [2024-10-11 02:37:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51837846] [2024-10-11 02:37:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:37:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:37:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:37:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:37:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51837846] [2024-10-11 02:37:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51837846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36242640] [2024-10-11 02:37:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:05,692 INFO L87 Difference]: Start difference. First operand 542 states and 914 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, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:10,329 INFO L93 Difference]: Finished difference Result 1404 states and 2446 transitions. [2024-10-11 02:37:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:10,329 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, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-11 02:37:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:10,335 INFO L225 Difference]: With dead ends: 1404 [2024-10-11 02:37:10,335 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 02:37:10,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:10,339 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1066 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:10,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1525 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:37:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 02:37:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 542. [2024-10-11 02:37:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 419 states have (on average 1.7088305489260143) internal successors, (716), 437 states have internal predecessors, (716), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2024-10-11 02:37:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 913 transitions. [2024-10-11 02:37:10,423 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 913 transitions. Word has length 76 [2024-10-11 02:37:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:10,423 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 913 transitions. [2024-10-11 02:37:10,423 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, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 913 transitions. [2024-10-11 02:37:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:37:10,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:10,426 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:37:10,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:10,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1694545189, now seen corresponding path program 1 times [2024-10-11 02:37:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186682828] [2024-10-11 02:37:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:37:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:37:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:37:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:37:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:37:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186682828] [2024-10-11 02:37:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186682828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845607205] [2024-10-11 02:37:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:10,840 INFO L87 Difference]: Start difference. First operand 542 states and 913 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, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:15,470 INFO L93 Difference]: Finished difference Result 1402 states and 2435 transitions. [2024-10-11 02:37:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:15,471 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, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-11 02:37:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:15,476 INFO L225 Difference]: With dead ends: 1402 [2024-10-11 02:37:15,476 INFO L226 Difference]: Without dead ends: 841 [2024-10-11 02:37:15,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:15,480 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 2049 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:15,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 1455 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2820 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:37:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-11 02:37:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 519. [2024-10-11 02:37:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 399 states have (on average 1.699248120300752) internal successors, (678), 415 states have internal predecessors, (678), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 871 transitions. [2024-10-11 02:37:15,571 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 871 transitions. Word has length 76 [2024-10-11 02:37:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:15,572 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 871 transitions. [2024-10-11 02:37:15,572 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, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 871 transitions. [2024-10-11 02:37:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 02:37:15,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:15,575 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:15,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:37:15,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 284735324, now seen corresponding path program 1 times [2024-10-11 02:37:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171881380] [2024-10-11 02:37:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:15,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:37:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:37:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:37:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:37:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:16,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:16,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171881380] [2024-10-11 02:37:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171881380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396956166] [2024-10-11 02:37:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:16,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:16,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:16,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:16,046 INFO L87 Difference]: Start difference. First operand 519 states and 871 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:22,246 INFO L93 Difference]: Finished difference Result 1366 states and 2367 transitions. [2024-10-11 02:37:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:22,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-10-11 02:37:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:22,252 INFO L225 Difference]: With dead ends: 1366 [2024-10-11 02:37:22,252 INFO L226 Difference]: Without dead ends: 835 [2024-10-11 02:37:22,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:22,255 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1553 mSDsluCounter, 2410 mSDsCounter, 0 mSdLazyCounter, 5220 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 5644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 5220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:22,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 2858 Invalid, 5644 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [424 Valid, 5220 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 02:37:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-11 02:37:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 513. [2024-10-11 02:37:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 393 states have (on average 1.6921119592875318) internal successors, (665), 409 states have internal predecessors, (665), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 858 transitions. [2024-10-11 02:37:22,367 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 858 transitions. Word has length 77 [2024-10-11 02:37:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:22,367 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 858 transitions. [2024-10-11 02:37:22,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 858 transitions. [2024-10-11 02:37:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 02:37:22,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:22,370 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:22,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:37:22,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2123397328, now seen corresponding path program 1 times [2024-10-11 02:37:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77637068] [2024-10-11 02:37:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:37:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:37:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:37:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:37:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:37:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77637068] [2024-10-11 02:37:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77637068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:22,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214145933] [2024-10-11 02:37:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:22,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:22,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:22,844 INFO L87 Difference]: Start difference. First operand 513 states and 858 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:28,904 INFO L93 Difference]: Finished difference Result 1338 states and 2318 transitions. [2024-10-11 02:37:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2024-10-11 02:37:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:28,917 INFO L225 Difference]: With dead ends: 1338 [2024-10-11 02:37:28,918 INFO L226 Difference]: Without dead ends: 835 [2024-10-11 02:37:28,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:37:28,925 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 1991 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 5610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:28,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 2629 Invalid, 5610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 5008 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 02:37:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-11 02:37:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 513. [2024-10-11 02:37:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 393 states have (on average 1.6895674300254453) internal successors, (664), 409 states have internal predecessors, (664), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 857 transitions. [2024-10-11 02:37:29,107 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 857 transitions. Word has length 78 [2024-10-11 02:37:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:29,107 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 857 transitions. [2024-10-11 02:37:29,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 857 transitions. [2024-10-11 02:37:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 02:37:29,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:29,109 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:29,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:37:29,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:29,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1366043847, now seen corresponding path program 1 times [2024-10-11 02:37:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545433137] [2024-10-11 02:37:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:37:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:37:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:37:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:37:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:37:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:29,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545433137] [2024-10-11 02:37:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545433137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534030159] [2024-10-11 02:37:29,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:29,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:29,827 INFO L87 Difference]: Start difference. First operand 513 states and 857 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:36,565 INFO L93 Difference]: Finished difference Result 1354 states and 2336 transitions. [2024-10-11 02:37:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 79 [2024-10-11 02:37:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:36,580 INFO L225 Difference]: With dead ends: 1354 [2024-10-11 02:37:36,580 INFO L226 Difference]: Without dead ends: 829 [2024-10-11 02:37:36,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:36,587 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 2024 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 5016 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 5623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 5016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:36,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 2672 Invalid, 5623 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [607 Valid, 5016 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 02:37:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-11 02:37:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 507. [2024-10-11 02:37:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 387 states have (on average 1.682170542635659) internal successors, (651), 403 states have internal predecessors, (651), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 844 transitions. [2024-10-11 02:37:36,738 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 844 transitions. Word has length 79 [2024-10-11 02:37:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:36,739 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 844 transitions. [2024-10-11 02:37:36,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 844 transitions. [2024-10-11 02:37:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 02:37:36,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:36,746 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:36,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:37:36,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:36,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2199410, now seen corresponding path program 1 times [2024-10-11 02:37:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800373812] [2024-10-11 02:37:36,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:37:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:37:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:37:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:37:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:37:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:37,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800373812] [2024-10-11 02:37:37,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800373812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:37,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124887803] [2024-10-11 02:37:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:37,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:37,394 INFO L87 Difference]: Start difference. First operand 507 states and 844 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:42,348 INFO L93 Difference]: Finished difference Result 1326 states and 2289 transitions. [2024-10-11 02:37:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:42,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2024-10-11 02:37:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:42,353 INFO L225 Difference]: With dead ends: 1326 [2024-10-11 02:37:42,353 INFO L226 Difference]: Without dead ends: 829 [2024-10-11 02:37:42,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:42,356 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 986 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 2802 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:42,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 1529 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2802 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:37:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-11 02:37:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 507. [2024-10-11 02:37:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 387 states have (on average 1.6795865633074936) internal successors, (650), 403 states have internal predecessors, (650), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 843 transitions. [2024-10-11 02:37:42,466 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 843 transitions. Word has length 80 [2024-10-11 02:37:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:42,466 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 843 transitions. [2024-10-11 02:37:42,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 843 transitions. [2024-10-11 02:37:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:37:42,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:42,468 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:42,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:37:42,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:42,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -934786372, now seen corresponding path program 1 times [2024-10-11 02:37:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022206647] [2024-10-11 02:37:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:37:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:37:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:37:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:37:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:37:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:42,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022206647] [2024-10-11 02:37:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022206647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:42,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:42,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619202117] [2024-10-11 02:37:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:42,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:42,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:42,920 INFO L87 Difference]: Start difference. First operand 507 states and 843 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:48,550 INFO L93 Difference]: Finished difference Result 1336 states and 2298 transitions. [2024-10-11 02:37:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-11 02:37:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:48,555 INFO L225 Difference]: With dead ends: 1336 [2024-10-11 02:37:48,555 INFO L226 Difference]: Without dead ends: 839 [2024-10-11 02:37:48,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:37:48,557 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1942 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 4919 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 5524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 4919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 2773 Invalid, 5524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 4919 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:37:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-11 02:37:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 512. [2024-10-11 02:37:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 392 states have (on average 1.6709183673469388) internal successors, (655), 408 states have internal predecessors, (655), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 848 transitions. [2024-10-11 02:37:48,697 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 848 transitions. Word has length 81 [2024-10-11 02:37:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:48,698 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 848 transitions. [2024-10-11 02:37:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 848 transitions. [2024-10-11 02:37:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:37:48,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:48,700 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:37:48,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:48,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1270411229, now seen corresponding path program 1 times [2024-10-11 02:37:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:48,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782811561] [2024-10-11 02:37:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:37:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:37:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:37:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:37:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:37:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782811561] [2024-10-11 02:37:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782811561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:49,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778243813] [2024-10-11 02:37:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:49,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:49,183 INFO L87 Difference]: Start difference. First operand 512 states and 848 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:55,308 INFO L93 Difference]: Finished difference Result 1347 states and 2308 transitions. [2024-10-11 02:37:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-11 02:37:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:55,312 INFO L225 Difference]: With dead ends: 1347 [2024-10-11 02:37:55,313 INFO L226 Difference]: Without dead ends: 823 [2024-10-11 02:37:55,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:55,316 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1483 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 5088 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 5506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 5088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:55,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 2761 Invalid, 5506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 5088 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:37:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-11 02:37:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 501. [2024-10-11 02:37:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 381 states have (on average 1.669291338582677) internal successors, (636), 397 states have internal predecessors, (636), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:37:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 829 transitions. [2024-10-11 02:37:55,417 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 829 transitions. Word has length 81 [2024-10-11 02:37:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:55,417 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 829 transitions. [2024-10-11 02:37:55,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 829 transitions. [2024-10-11 02:37:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:37:55,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:55,419 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:55,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:37:55,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:55,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -954306505, now seen corresponding path program 1 times [2024-10-11 02:37:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:55,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47812255] [2024-10-11 02:37:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:37:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:37:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:37:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:37:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:37:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47812255] [2024-10-11 02:37:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47812255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485393929] [2024-10-11 02:37:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:55,875 INFO L87 Difference]: Start difference. First operand 501 states and 829 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:01,619 INFO L93 Difference]: Finished difference Result 1320 states and 2264 transitions. [2024-10-11 02:38:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:01,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2024-10-11 02:38:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:01,623 INFO L225 Difference]: With dead ends: 1320 [2024-10-11 02:38:01,623 INFO L226 Difference]: Without dead ends: 829 [2024-10-11 02:38:01,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:38:01,625 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1417 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 4945 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 5364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 4945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:01,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 2754 Invalid, 5364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 4945 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:38:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-11 02:38:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 507. [2024-10-11 02:38:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 387 states have (on average 1.6589147286821706) internal successors, (642), 403 states have internal predecessors, (642), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:38:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 835 transitions. [2024-10-11 02:38:01,726 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 835 transitions. Word has length 82 [2024-10-11 02:38:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:01,726 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 835 transitions. [2024-10-11 02:38:01,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 835 transitions. [2024-10-11 02:38:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:38:01,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:01,728 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:01,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:38:01,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:01,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -510405831, now seen corresponding path program 1 times [2024-10-11 02:38:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750489116] [2024-10-11 02:38:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:01,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:38:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:38:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:02,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:02,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750489116] [2024-10-11 02:38:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750489116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:02,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918385055] [2024-10-11 02:38:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:02,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:02,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:02,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:02,144 INFO L87 Difference]: Start difference. First operand 507 states and 835 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:08,053 INFO L93 Difference]: Finished difference Result 1328 states and 2270 transitions. [2024-10-11 02:38:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:08,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2024-10-11 02:38:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:08,058 INFO L225 Difference]: With dead ends: 1328 [2024-10-11 02:38:08,058 INFO L226 Difference]: Without dead ends: 823 [2024-10-11 02:38:08,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:38:08,060 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 951 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 5002 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 5246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 5002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:08,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 2879 Invalid, 5246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 5002 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 02:38:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-11 02:38:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 501. [2024-10-11 02:38:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 381 states have (on average 1.6666666666666667) internal successors, (635), 397 states have internal predecessors, (635), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-11 02:38:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 828 transitions. [2024-10-11 02:38:08,166 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 828 transitions. Word has length 82 [2024-10-11 02:38:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:08,166 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 828 transitions. [2024-10-11 02:38:08,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 828 transitions. [2024-10-11 02:38:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:38:08,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:08,168 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:08,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:38:08,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:08,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash -233715614, now seen corresponding path program 1 times [2024-10-11 02:38:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:08,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19800734] [2024-10-11 02:38:08,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:38:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:38:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:08,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19800734] [2024-10-11 02:38:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19800734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:08,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:08,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:08,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917986400] [2024-10-11 02:38:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:08,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:08,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:08,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:08,580 INFO L87 Difference]: Start difference. First operand 501 states and 828 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 02:38:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:16,103 INFO L93 Difference]: Finished difference Result 1996 states and 3465 transitions. [2024-10-11 02:38:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 83 [2024-10-11 02:38:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:16,112 INFO L225 Difference]: With dead ends: 1996 [2024-10-11 02:38:16,112 INFO L226 Difference]: Without dead ends: 1507 [2024-10-11 02:38:16,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:38:16,115 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 2193 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:16,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 1694 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-10-11 02:38:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-10-11 02:38:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 938. [2024-10-11 02:38:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 717 states have (on average 1.6248256624825663) internal successors, (1165), 747 states have internal predecessors, (1165), 180 states have call successors, (180), 43 states have call predecessors, (180), 40 states have return successors, (185), 171 states have call predecessors, (185), 176 states have call successors, (185) [2024-10-11 02:38:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1530 transitions. [2024-10-11 02:38:16,353 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1530 transitions. Word has length 83 [2024-10-11 02:38:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:16,354 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1530 transitions. [2024-10-11 02:38:16,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 02:38:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1530 transitions. [2024-10-11 02:38:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 02:38:16,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:16,355 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:16,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:38:16,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:16,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash 781897754, now seen corresponding path program 1 times [2024-10-11 02:38:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212653845] [2024-10-11 02:38:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:16,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:38:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:38:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:38:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212653845] [2024-10-11 02:38:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212653845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:38:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855287535] [2024-10-11 02:38:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:16,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:16,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:38:16,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:38:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:17,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:38:17,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:38:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:17,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:38:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855287535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:38:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:38:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021682914] [2024-10-11 02:38:17,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:17,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:38:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:38:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:17,302 INFO L87 Difference]: Start difference. First operand 938 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:38:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:17,757 INFO L93 Difference]: Finished difference Result 2702 states and 4486 transitions. [2024-10-11 02:38:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:38:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2024-10-11 02:38:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:17,765 INFO L225 Difference]: With dead ends: 2702 [2024-10-11 02:38:17,765 INFO L226 Difference]: Without dead ends: 1776 [2024-10-11 02:38:17,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:17,770 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 770 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:17,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1595 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:38:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-10-11 02:38:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1718. [2024-10-11 02:38:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1323 states have (on average 1.6424792139077853) internal successors, (2173), 1383 states have internal predecessors, (2173), 319 states have call successors, (319), 76 states have call predecessors, (319), 75 states have return successors, (342), 306 states have call predecessors, (342), 315 states have call successors, (342) [2024-10-11 02:38:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2834 transitions. [2024-10-11 02:38:18,182 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2834 transitions. Word has length 87 [2024-10-11 02:38:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2834 transitions. [2024-10-11 02:38:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:38:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2834 transitions. [2024-10-11 02:38:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:38:18,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:18,185 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:18,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:38:18,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 02:38:18,390 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:18,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -827425500, now seen corresponding path program 1 times [2024-10-11 02:38:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:18,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019971394] [2024-10-11 02:38:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:38:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:38:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:38:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019971394] [2024-10-11 02:38:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019971394] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:38:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868039543] [2024-10-11 02:38:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:18,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:38:18,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:38:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:38:19,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:38:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:19,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:38:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868039543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:19,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:38:19,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:38:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099600929] [2024-10-11 02:38:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:38:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:38:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:19,181 INFO L87 Difference]: Start difference. First operand 1718 states and 2834 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:38:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:19,744 INFO L93 Difference]: Finished difference Result 3863 states and 6422 transitions. [2024-10-11 02:38:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:38:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 88 [2024-10-11 02:38:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:19,755 INFO L225 Difference]: With dead ends: 3863 [2024-10-11 02:38:19,755 INFO L226 Difference]: Without dead ends: 2157 [2024-10-11 02:38:19,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:19,761 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 768 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:19,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1538 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:38:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-10-11 02:38:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2104. [2024-10-11 02:38:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 1624 states have (on average 1.6545566502463054) internal successors, (2687), 1699 states have internal predecessors, (2687), 388 states have call successors, (388), 91 states have call predecessors, (388), 91 states have return successors, (415), 374 states have call predecessors, (415), 384 states have call successors, (415) [2024-10-11 02:38:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 3490 transitions. [2024-10-11 02:38:20,263 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 3490 transitions. Word has length 88 [2024-10-11 02:38:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:20,264 INFO L471 AbstractCegarLoop]: Abstraction has 2104 states and 3490 transitions. [2024-10-11 02:38:20,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:38:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 3490 transitions. [2024-10-11 02:38:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:38:20,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:20,266 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:20,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:38:20,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:20,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:20,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1580315322, now seen corresponding path program 1 times [2024-10-11 02:38:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834284295] [2024-10-11 02:38:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:38:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:38:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:38:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:38:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:38:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834284295] [2024-10-11 02:38:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834284295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981920138] [2024-10-11 02:38:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:20,927 INFO L87 Difference]: Start difference. First operand 2104 states and 3490 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12)