./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:53:11,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:53:11,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:53:11,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:53:11,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:53:11,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:53:11,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:53:11,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:53:11,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:53:11,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:53:11,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:53:11,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:53:11,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:53:11,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:53:11,850 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:53:11,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:53:11,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:53:11,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:53:11,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:53:11,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:53:11,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:53:11,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:53:11,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:53:11,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:53:11,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:53:11,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:53:11,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:53:11,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:53:11,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:53:11,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:53:11,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:53:11,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:53:11,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:53:11,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:53:11,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:53:11,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:53:11,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:53:11,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:53:11,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:53:11,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:53:11,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:53:11,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:53:11,865 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/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/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 -> f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c [2024-11-08 14:53:12,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:53:12,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:53:12,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:53:12,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:53:12,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:53:12,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2024-11-08 14:53:13,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:53:13,828 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:53:13,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2024-11-08 14:53:13,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227cb6180/e295dec98292423cbaf01fde73e3bc5e/FLAGce460877a [2024-11-08 14:53:13,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/227cb6180/e295dec98292423cbaf01fde73e3bc5e [2024-11-08 14:53:13,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:53:13,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:53:13,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:53:13,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:53:13,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:53:13,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:53:13" (1/1) ... [2024-11-08 14:53:13,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50eb957a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:13, skipping insertion in model container [2024-11-08 14:53:13,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:53:13" (1/1) ... [2024-11-08 14:53:13,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:53:14,170 WARN L250 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_product23.cil.c[5798,5811] [2024-11-08 14:53:14,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:53:14,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:53:14,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-08 14:53:14,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2024-11-08 14:53:14,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [260] [2024-11-08 14:53:14,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [269] [2024-11-08 14:53:14,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1874] [2024-11-08 14:53:14,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1968] [2024-11-08 14:53:14,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2086] [2024-11-08 14:53:14,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2124] [2024-11-08 14:53:14,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2472] [2024-11-08 14:53:14,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2838] [2024-11-08 14:53:14,476 WARN L250 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_product23.cil.c[5798,5811] [2024-11-08 14:53:14,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:53:14,594 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:53:14,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14 WrapperNode [2024-11-08 14:53:14,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:53:14,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:53:14,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:53:14,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:53:14,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,673 INFO L138 Inliner]: procedures = 94, calls = 353, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 944 [2024-11-08 14:53:14,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:53:14,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:53:14,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:53:14,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:53:14,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,742 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-11-08 14:53:14,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:53:14,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:53:14,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:53:14,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:53:14,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (1/1) ... [2024-11-08 14:53:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:53:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:53:14,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:53:14,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:53:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:53:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-08 14:53:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-08 14:53:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-11-08 14:53:14,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-11-08 14:53:14,969 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-08 14:53:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-08 14:53:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-08 14:53:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-08 14:53:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-08 14:53:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-08 14:53:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-08 14:53:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-08 14:53:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-11-08 14:53:14,971 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-11-08 14:53:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-08 14:53:14,972 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-08 14:53:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 14:53:14,972 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 14:53:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 14:53:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 14:53:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-08 14:53:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-08 14:53:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-08 14:53:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-08 14:53:14,977 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-08 14:53:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-08 14:53:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-08 14:53:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-08 14:53:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-08 14:53:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-08 14:53:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-11-08 14:53:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-11-08 14:53:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-08 14:53:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-08 14:53:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-08 14:53:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-08 14:53:14,978 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-11-08 14:53:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-11-08 14:53:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-08 14:53:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-08 14:53:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-08 14:53:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-08 14:53:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-08 14:53:14,980 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-08 14:53:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:53:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:53:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 14:53:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-08 14:53:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-08 14:53:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-08 14:53:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-08 14:53:14,983 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-08 14:53:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-08 14:53:14,983 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-08 14:53:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-08 14:53:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-08 14:53:14,988 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-11-08 14:53:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-11-08 14:53:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:53:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:53:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-08 14:53:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-08 14:53:15,274 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:53:15,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:53:16,522 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2024-11-08 14:53:16,523 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:53:16,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:53:16,557 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:53:16,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:53:16 BoogieIcfgContainer [2024-11-08 14:53:16,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:53:16,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:53:16,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:53:16,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:53:16,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:53:13" (1/3) ... [2024-11-08 14:53:16,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d47d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:53:16, skipping insertion in model container [2024-11-08 14:53:16,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:53:14" (2/3) ... [2024-11-08 14:53:16,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d47d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:53:16, skipping insertion in model container [2024-11-08 14:53:16,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:53:16" (3/3) ... [2024-11-08 14:53:16,567 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2024-11-08 14:53:16,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:53:16,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:53:16,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:53:16,674 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;@1132fb69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:53:16,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:53:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 612 states, 469 states have (on average 1.6609808102345416) internal successors, (779), 487 states have internal predecessors, (779), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2024-11-08 14:53:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 14:53:16,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:53:16,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:53:16,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:53:16,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:53:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash 491120324, now seen corresponding path program 1 times [2024-11-08 14:53:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:53:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611086709] [2024-11-08 14:53:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:53:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:53:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:17,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:53:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:53:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 14:53:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 14:53:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 14:53:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 14:53:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:53:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 14:53:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 14:53:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:53:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:53:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611086709] [2024-11-08 14:53:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611086709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:53:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:53:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:53:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56400892] [2024-11-08 14:53:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:53:18,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:53:18,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:53:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:53:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:53:18,300 INFO L87 Difference]: Start difference. First operand has 612 states, 469 states have (on average 1.6609808102345416) internal successors, (779), 487 states have internal predecessors, (779), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:53:26,792 INFO L93 Difference]: Finished difference Result 1575 states and 2698 transitions. [2024-11-08 14:53:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:53:26,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-11-08 14:53:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:53:26,828 INFO L225 Difference]: With dead ends: 1575 [2024-11-08 14:53:26,828 INFO L226 Difference]: Without dead ends: 963 [2024-11-08 14:53:26,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:53:26,846 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 1195 mSDsluCounter, 2791 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 6044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:53:26,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 3287 Invalid, 6044 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [284 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 14:53:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-08 14:53:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 615. [2024-11-08 14:53:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 472 states have (on average 1.652542372881356) internal successors, (780), 490 states have internal predecessors, (780), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (113), 109 states have call predecessors, (113), 111 states have call successors, (113) [2024-11-08 14:53:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1007 transitions. [2024-11-08 14:53:27,134 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1007 transitions. Word has length 115 [2024-11-08 14:53:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:53:27,136 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 1007 transitions. [2024-11-08 14:53:27,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1007 transitions. [2024-11-08 14:53:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 14:53:27,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:53:27,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:53:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:53:27,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:53:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:53:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1724210675, now seen corresponding path program 1 times [2024-11-08 14:53:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:53:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331709178] [2024-11-08 14:53:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:53:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:53:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:53:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 14:53:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 14:53:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 14:53:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:53:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 14:53:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:53:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 14:53:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 14:53:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:53:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:53:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331709178] [2024-11-08 14:53:28,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331709178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:53:28,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:53:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:53:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489786482] [2024-11-08 14:53:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:53:28,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:53:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:53:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:53:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:53:28,005 INFO L87 Difference]: Start difference. First operand 615 states and 1007 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:53:34,705 INFO L93 Difference]: Finished difference Result 1562 states and 2641 transitions. [2024-11-08 14:53:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:53:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2024-11-08 14:53:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:53:34,713 INFO L225 Difference]: With dead ends: 1562 [2024-11-08 14:53:34,714 INFO L226 Difference]: Without dead ends: 963 [2024-11-08 14:53:34,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:53:34,719 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1714 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 5696 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 6189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 5696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:53:34,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 2987 Invalid, 6189 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [493 Valid, 5696 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-08 14:53:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-08 14:53:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 615. [2024-11-08 14:53:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 472 states have (on average 1.6504237288135593) internal successors, (779), 490 states have internal predecessors, (779), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (113), 109 states have call predecessors, (113), 111 states have call successors, (113) [2024-11-08 14:53:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1006 transitions. [2024-11-08 14:53:34,876 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1006 transitions. Word has length 116 [2024-11-08 14:53:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:53:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 1006 transitions. [2024-11-08 14:53:34,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1006 transitions. [2024-11-08 14:53:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 14:53:34,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:53:34,883 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:53:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:53:34,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:53:34,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:53:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash -122326703, now seen corresponding path program 1 times [2024-11-08 14:53:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:53:34,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320831927] [2024-11-08 14:53:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:53:34,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:53:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:53:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:53:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 14:53:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 14:53:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 14:53:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:53:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 14:53:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:53:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 14:53:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 14:53:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:53:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:53:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320831927] [2024-11-08 14:53:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320831927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:53:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:53:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:53:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012914849] [2024-11-08 14:53:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:53:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:53:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:53:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:53:35,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:53:35,420 INFO L87 Difference]: Start difference. First operand 615 states and 1006 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 14:53:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:53:40,652 INFO L93 Difference]: Finished difference Result 1556 states and 2624 transitions. [2024-11-08 14:53:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:53:40,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-08 14:53:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:53:40,660 INFO L225 Difference]: With dead ends: 1556 [2024-11-08 14:53:40,660 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 14:53:40,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:53:40,667 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 2254 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:53:40,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 1632 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 14:53:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 14:53:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 591. [2024-11-08 14:53:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 451 states have (on average 1.6407982261640799) internal successors, (740), 467 states have internal predecessors, (740), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:53:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 963 transitions. [2024-11-08 14:53:40,808 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 963 transitions. Word has length 116 [2024-11-08 14:53:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:53:40,809 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 963 transitions. [2024-11-08 14:53:40,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 14:53:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 963 transitions. [2024-11-08 14:53:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 14:53:40,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:53:40,812 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:53:40,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:53:40,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:53:40,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:53:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 274166256, now seen corresponding path program 1 times [2024-11-08 14:53:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:53:40,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302930658] [2024-11-08 14:53:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:53:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:53:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:53:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 14:53:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 14:53:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 14:53:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 14:53:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:53:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:53:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 14:53:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 14:53:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:53:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:53:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302930658] [2024-11-08 14:53:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302930658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:53:41,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:53:41,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:53:41,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383988722] [2024-11-08 14:53:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:53:41,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:53:41,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:53:41,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:53:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:53:41,634 INFO L87 Difference]: Start difference. First operand 591 states and 963 transitions. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:53:48,078 INFO L93 Difference]: Finished difference Result 1519 states and 2555 transitions. [2024-11-08 14:53:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:53:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2024-11-08 14:53:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:53:48,084 INFO L225 Difference]: With dead ends: 1519 [2024-11-08 14:53:48,084 INFO L226 Difference]: Without dead ends: 920 [2024-11-08 14:53:48,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:53:48,089 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 1688 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 5483 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 5976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 5483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:53:48,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 3194 Invalid, 5976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [493 Valid, 5483 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-08 14:53:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-08 14:53:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 585. [2024-11-08 14:53:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 445 states have (on average 1.6337078651685393) internal successors, (727), 461 states have internal predecessors, (727), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:53:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 950 transitions. [2024-11-08 14:53:48,210 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 950 transitions. Word has length 117 [2024-11-08 14:53:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:53:48,210 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 950 transitions. [2024-11-08 14:53:48,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 950 transitions. [2024-11-08 14:53:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 14:53:48,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:53:48,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:53:48,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:53:48,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:53:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:53:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -709580357, now seen corresponding path program 1 times [2024-11-08 14:53:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:53:48,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229180721] [2024-11-08 14:53:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:53:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:53:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:53:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:53:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:53:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 14:53:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 14:53:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 14:53:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:53:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 14:53:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 14:53:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:53:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:53:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229180721] [2024-11-08 14:53:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229180721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:53:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:53:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:53:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143198095] [2024-11-08 14:53:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:53:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:53:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:53:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:53:48,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:53:48,849 INFO L87 Difference]: Start difference. First operand 585 states and 950 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:53:55,033 INFO L93 Difference]: Finished difference Result 1489 states and 2504 transitions. [2024-11-08 14:53:55,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:53:55,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2024-11-08 14:53:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:53:55,040 INFO L225 Difference]: With dead ends: 1489 [2024-11-08 14:53:55,040 INFO L226 Difference]: Without dead ends: 920 [2024-11-08 14:53:55,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:53:55,045 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 1076 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 5496 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 5496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:53:55,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 3100 Invalid, 5765 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [269 Valid, 5496 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 14:53:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-08 14:53:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 585. [2024-11-08 14:53:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 445 states have (on average 1.6314606741573034) internal successors, (726), 461 states have internal predecessors, (726), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:53:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 949 transitions. [2024-11-08 14:53:55,169 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 949 transitions. Word has length 118 [2024-11-08 14:53:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:53:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 949 transitions. [2024-11-08 14:53:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:53:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 949 transitions. [2024-11-08 14:53:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 14:53:55,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:53:55,179 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:53:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:53:55,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:53:55,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:53:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1477118611, now seen corresponding path program 1 times [2024-11-08 14:53:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:53:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257822320] [2024-11-08 14:53:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:53:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:53:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:53:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:53:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 14:53:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:53:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 14:53:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 14:53:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 14:53:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:53:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:53:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 14:53:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 14:53:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:53:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:53:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:53:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257822320] [2024-11-08 14:53:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257822320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:53:55,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:53:55,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:53:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318791999] [2024-11-08 14:53:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:53:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:53:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:53:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:53:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:53:55,843 INFO L87 Difference]: Start difference. First operand 585 states and 949 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:54:01,883 INFO L93 Difference]: Finished difference Result 1507 states and 2524 transitions. [2024-11-08 14:54:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:54:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 119 [2024-11-08 14:54:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:54:01,891 INFO L225 Difference]: With dead ends: 1507 [2024-11-08 14:54:01,891 INFO L226 Difference]: Without dead ends: 914 [2024-11-08 14:54:01,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:54:01,896 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 2213 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 5306 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 6021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 5306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 14:54:01,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 2980 Invalid, 6021 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [715 Valid, 5306 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 14:54:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-08 14:54:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 579. [2024-11-08 14:54:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 439 states have (on average 1.6241457858769932) internal successors, (713), 455 states have internal predecessors, (713), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:54:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 936 transitions. [2024-11-08 14:54:02,054 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 936 transitions. Word has length 119 [2024-11-08 14:54:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:54:02,054 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 936 transitions. [2024-11-08 14:54:02,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 936 transitions. [2024-11-08 14:54:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 14:54:02,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:54:02,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:54:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:54:02,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:54:02,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:54:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1759420828, now seen corresponding path program 1 times [2024-11-08 14:54:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:54:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454873660] [2024-11-08 14:54:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:54:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:54:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:54:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 14:54:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 14:54:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 14:54:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 14:54:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 14:54:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:54:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 14:54:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 14:54:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:54:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:54:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454873660] [2024-11-08 14:54:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454873660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:54:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:54:02,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:54:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182281884] [2024-11-08 14:54:02,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:54:02,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:54:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:54:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:54:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:54:02,659 INFO L87 Difference]: Start difference. First operand 579 states and 936 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:54:08,540 INFO L93 Difference]: Finished difference Result 1477 states and 2475 transitions. [2024-11-08 14:54:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:54:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-11-08 14:54:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:54:08,546 INFO L225 Difference]: With dead ends: 1477 [2024-11-08 14:54:08,547 INFO L226 Difference]: Without dead ends: 914 [2024-11-08 14:54:08,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:54:08,550 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1610 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 5225 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 5725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 5225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:54:08,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 3069 Invalid, 5725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 5225 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-08 14:54:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-08 14:54:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 579. [2024-11-08 14:54:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 439 states have (on average 1.6218678815489749) internal successors, (712), 455 states have internal predecessors, (712), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:54:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 935 transitions. [2024-11-08 14:54:08,698 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 935 transitions. Word has length 120 [2024-11-08 14:54:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:54:08,698 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 935 transitions. [2024-11-08 14:54:08,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 935 transitions. [2024-11-08 14:54:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 14:54:08,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:54:08,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:54:08,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 14:54:08,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:54:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:54:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1565700111, now seen corresponding path program 1 times [2024-11-08 14:54:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:54:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276813127] [2024-11-08 14:54:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:54:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:54:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:54:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 14:54:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 14:54:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 14:54:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:54:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 14:54:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:54:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 14:54:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 14:54:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:54:09,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:54:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276813127] [2024-11-08 14:54:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276813127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:54:09,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:54:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:54:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588769243] [2024-11-08 14:54:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:54:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:54:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:54:09,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:54:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:54:09,321 INFO L87 Difference]: Start difference. First operand 579 states and 935 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:54:15,549 INFO L93 Difference]: Finished difference Result 1495 states and 2493 transitions. [2024-11-08 14:54:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:54:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2024-11-08 14:54:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:54:15,555 INFO L225 Difference]: With dead ends: 1495 [2024-11-08 14:54:15,555 INFO L226 Difference]: Without dead ends: 908 [2024-11-08 14:54:15,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:54:15,558 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2160 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 5273 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 5975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 5273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:54:15,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 3053 Invalid, 5975 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [702 Valid, 5273 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-08 14:54:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-08 14:54:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 573. [2024-11-08 14:54:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 433 states have (on average 1.6143187066974596) internal successors, (699), 449 states have internal predecessors, (699), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:54:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 922 transitions. [2024-11-08 14:54:15,685 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 922 transitions. Word has length 121 [2024-11-08 14:54:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:54:15,686 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 922 transitions. [2024-11-08 14:54:15,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 922 transitions. [2024-11-08 14:54:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 14:54:15,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:54:15,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:54:15,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 14:54:15,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:54:15,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:54:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash 95761168, now seen corresponding path program 1 times [2024-11-08 14:54:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:54:15,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624495657] [2024-11-08 14:54:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:54:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:54:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:15,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:54:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 14:54:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 14:54:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 14:54:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:54:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 14:54:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:54:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 14:54:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 14:54:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:54:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:54:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624495657] [2024-11-08 14:54:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624495657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:54:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:54:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:54:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713212669] [2024-11-08 14:54:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:54:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:54:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:54:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:54:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:54:16,220 INFO L87 Difference]: Start difference. First operand 573 states and 922 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 14:54:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:54:20,812 INFO L93 Difference]: Finished difference Result 1465 states and 2446 transitions. [2024-11-08 14:54:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:54:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-11-08 14:54:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:54:20,818 INFO L225 Difference]: With dead ends: 1465 [2024-11-08 14:54:20,818 INFO L226 Difference]: Without dead ends: 908 [2024-11-08 14:54:20,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:54:20,820 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 2107 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 2691 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 14:54:20,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 1615 Invalid, 3398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2691 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 14:54:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-08 14:54:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 573. [2024-11-08 14:54:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 433 states have (on average 1.6120092378752886) internal successors, (698), 449 states have internal predecessors, (698), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:54:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 921 transitions. [2024-11-08 14:54:20,980 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 921 transitions. Word has length 121 [2024-11-08 14:54:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:54:20,980 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 921 transitions. [2024-11-08 14:54:20,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 14:54:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 921 transitions. [2024-11-08 14:54:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 14:54:20,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:54:20,983 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:54:20,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 14:54:20,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:54:20,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:54:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1504025148, now seen corresponding path program 1 times [2024-11-08 14:54:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:54:20,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311440475] [2024-11-08 14:54:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:54:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:54:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:54:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 14:54:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 14:54:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:54:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 14:54:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:54:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:54:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 14:54:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 14:54:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:54:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:54:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311440475] [2024-11-08 14:54:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311440475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:54:21,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:54:21,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:54:21,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110232941] [2024-11-08 14:54:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:54:21,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:54:21,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:54:21,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:54:21,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:54:21,549 INFO L87 Difference]: Start difference. First operand 573 states and 921 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:54:27,529 INFO L93 Difference]: Finished difference Result 1477 states and 2455 transitions. [2024-11-08 14:54:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 14:54:27,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2024-11-08 14:54:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:54:27,535 INFO L225 Difference]: With dead ends: 1477 [2024-11-08 14:54:27,535 INFO L226 Difference]: Without dead ends: 908 [2024-11-08 14:54:27,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-08 14:54:27,537 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1042 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 5261 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 3038 SdHoareTripleChecker+Invalid, 5534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 5261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:54:27,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 3038 Invalid, 5534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 5261 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-08 14:54:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-08 14:54:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 573. [2024-11-08 14:54:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 433 states have (on average 1.6096997690531178) internal successors, (697), 449 states have internal predecessors, (697), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 14:54:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 920 transitions. [2024-11-08 14:54:27,697 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 920 transitions. Word has length 122 [2024-11-08 14:54:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:54:27,698 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 920 transitions. [2024-11-08 14:54:27,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 14:54:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 920 transitions. [2024-11-08 14:54:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 14:54:27,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:54:27,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:54:27,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 14:54:27,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:54:27,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:54:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1832589464, now seen corresponding path program 1 times [2024-11-08 14:54:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:54:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014350433] [2024-11-08 14:54:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:54:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:54:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:54:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:54:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:54:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:54:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 14:54:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:54:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 14:54:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:54:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 14:54:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 14:54:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 14:54:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:54:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:54:28,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:54:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014350433] [2024-11-08 14:54:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014350433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:54:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:54:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 14:54:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501996465] [2024-11-08 14:54:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:54:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:54:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:54:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:54:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:54:28,276 INFO L87 Difference]: Start difference. First operand 573 states and 920 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)