./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:37:47,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:37:47,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:37:47,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:37:47,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:37:47,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:37:47,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:37:47,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:37:47,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:37:47,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:37:47,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:37:47,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:37:47,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:37:47,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:37:47,213 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:37:47,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:37:47,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:37:47,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:37:47,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:37:47,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:37:47,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:37:47,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:37:47,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:37:47,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:37:47,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:37:47,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:37:47,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:37:47,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:37:47,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:37:47,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:37:47,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:37:47,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:37:47,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:47,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:37:47,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:37:47,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:37:47,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:37:47,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:37:47,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:37:47,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:37:47,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:37:47,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:37:47,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c [2024-10-11 02:37:47,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:37:47,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:37:47,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:37:47,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:37:47,547 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:37:47,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2024-10-11 02:37:48,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:37:49,242 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:37:49,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2024-10-11 02:37:49,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a611d0941/fe653bf49ac04763a28ea916d1a9758a/FLAGa219a0451 [2024-10-11 02:37:49,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a611d0941/fe653bf49ac04763a28ea916d1a9758a [2024-10-11 02:37:49,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:37:49,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:37:49,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:49,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:37:49,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:37:49,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:49" (1/1) ... [2024-10-11 02:37:49,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495a77a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:49, skipping insertion in model container [2024-10-11 02:37:49,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:49" (1/1) ... [2024-10-11 02:37:49,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:37:49,573 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c[5798,5811] [2024-10-11 02:37:49,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:49,879 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:37:49,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-11 02:37:49,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2024-10-11 02:37:49,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [260] [2024-10-11 02:37:49,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [269] [2024-10-11 02:37:49,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1874] [2024-10-11 02:37:49,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1968] [2024-10-11 02:37:49,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2086] [2024-10-11 02:37:49,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2124] [2024-10-11 02:37:49,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2472] [2024-10-11 02:37:49,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2838] [2024-10-11 02:37:49,905 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c[5798,5811] [2024-10-11 02:37:50,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:50,040 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:37:50,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50 WrapperNode [2024-10-11 02:37:50,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:50,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:50,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:37:50,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:37:50,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,138 INFO L138 Inliner]: procedures = 94, calls = 353, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 944 [2024-10-11 02:37:50,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:50,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:37:50,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:37:50,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:37:50,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,205 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:37:50,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:37:50,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:37:50,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:37:50,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:37:50,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (1/1) ... [2024-10-11 02:37:50,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:50,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:37:50,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:37:50,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:37:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:37:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:37:50,387 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:37:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:37:50,387 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:37:50,388 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:37:50,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:37:50,388 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:37:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:37:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:37:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:37:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:37:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:37:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:37:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:37:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:37:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:37:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:37:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:37:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:37:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:37:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:37:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:37:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:37:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:37:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:37:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:37:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:37:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:37:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:37:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:37:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:37:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:37:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:37:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:37:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:37:50,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:37:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:37:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:37:50,405 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:37:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:37:50,405 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:37:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:37:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:37:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:37:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:37:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:37:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:37:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:37:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:37:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:37:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:37:50,616 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:37:50,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:37:51,811 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2024-10-11 02:37:51,811 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:37:51,891 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:37:51,893 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:37:51,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:51 BoogieIcfgContainer [2024-10-11 02:37:51,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:37:51,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:37:51,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:37:51,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:37:51,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:37:49" (1/3) ... [2024-10-11 02:37:51,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499eb8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:51, skipping insertion in model container [2024-10-11 02:37:51,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:50" (2/3) ... [2024-10-11 02:37:51,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499eb8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:51, skipping insertion in model container [2024-10-11 02:37:51,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:51" (3/3) ... [2024-10-11 02:37:51,902 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2024-10-11 02:37:51,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:37:51,918 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:37:51,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:37:51,999 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;@3062a1ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:37:51,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:37:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 447 states have (on average 1.6935123042505593) internal successors, (757), 465 states have internal predecessors, (757), 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-10-11 02:37:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:37:52,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:52,035 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:37:52,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:52,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1022480858, now seen corresponding path program 1 times [2024-10-11 02:37:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:52,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53306496] [2024-10-11 02:37:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:37:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:37:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:37:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:37:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:37:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:37:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:37:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53306496] [2024-10-11 02:37:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53306496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528627600] [2024-10-11 02:37:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:53,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:53,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:53,554 INFO L87 Difference]: Start difference. First operand has 590 states, 447 states have (on average 1.6935123042505593) internal successors, (757), 465 states have internal predecessors, (757), 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 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 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-10-11 02:38:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:01,800 INFO L93 Difference]: Finished difference Result 1518 states and 2641 transitions. [2024-10-11 02:38:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (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 101 [2024-10-11 02:38:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:01,835 INFO L225 Difference]: With dead ends: 1518 [2024-10-11 02:38:01,835 INFO L226 Difference]: Without dead ends: 925 [2024-10-11 02:38:01,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:38:01,855 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 1733 mSDsluCounter, 2468 mSDsCounter, 0 mSdLazyCounter, 5793 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 6286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 5793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:01,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 2922 Invalid, 6286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [493 Valid, 5793 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-11 02:38:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-10-11 02:38:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 596. [2024-10-11 02:38:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 453 states have (on average 1.6799116997792494) internal successors, (761), 471 states have internal predecessors, (761), 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-10-11 02:38:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 988 transitions. [2024-10-11 02:38:02,136 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 988 transitions. Word has length 101 [2024-10-11 02:38:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:02,137 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 988 transitions. [2024-10-11 02:38:02,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (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-10-11 02:38:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 988 transitions. [2024-10-11 02:38:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:38:02,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:02,145 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:02,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:38:02,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash -809739457, now seen corresponding path program 1 times [2024-10-11 02:38:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535281683] [2024-10-11 02:38:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:38:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:38:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:38:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:38:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:38:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535281683] [2024-10-11 02:38:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535281683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:02,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:02,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135329047] [2024-10-11 02:38:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:02,966 INFO L87 Difference]: Start difference. First operand 596 states and 988 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 6 states have internal predecessors, (60), 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-10-11 02:38:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:09,725 INFO L93 Difference]: Finished difference Result 1511 states and 2590 transitions. [2024-10-11 02:38:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 6 states have internal predecessors, (60), 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 102 [2024-10-11 02:38:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:09,733 INFO L225 Difference]: With dead ends: 1511 [2024-10-11 02:38:09,734 INFO L226 Difference]: Without dead ends: 925 [2024-10-11 02:38:09,737 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-10-11 02:38:09,738 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 2248 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 5641 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 6353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 5641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:09,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 2834 Invalid, 6353 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [712 Valid, 5641 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 02:38:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-10-11 02:38:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 596. [2024-10-11 02:38:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 453 states have (on average 1.6777041942604856) internal successors, (760), 471 states have internal predecessors, (760), 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-10-11 02:38:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 987 transitions. [2024-10-11 02:38:09,968 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 987 transitions. Word has length 102 [2024-10-11 02:38:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:09,969 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 987 transitions. [2024-10-11 02:38:09,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 6 states have internal predecessors, (60), 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-10-11 02:38:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 987 transitions. [2024-10-11 02:38:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:38:09,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:09,973 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:09,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:38:09,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash -110318435, now seen corresponding path program 1 times [2024-10-11 02:38:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42822378] [2024-10-11 02:38:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:38:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:38:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:38:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:38:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:38:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:38:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:38:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42822378] [2024-10-11 02:38:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42822378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:10,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005496445] [2024-10-11 02:38:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:10,498 INFO L87 Difference]: Start difference. First operand 596 states and 987 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 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-10-11 02:38:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:15,661 INFO L93 Difference]: Finished difference Result 1505 states and 2573 transitions. [2024-10-11 02:38:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:38:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 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 102 [2024-10-11 02:38:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:15,668 INFO L225 Difference]: With dead ends: 1505 [2024-10-11 02:38:15,668 INFO L226 Difference]: Without dead ends: 890 [2024-10-11 02:38:15,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:38:15,673 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 2192 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:15,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 1481 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:38:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-11 02:38:15,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 573. [2024-10-11 02:38:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 433 states have (on average 1.6674364896073903) internal successors, (722), 449 states have internal predecessors, (722), 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-10-11 02:38:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 945 transitions. [2024-10-11 02:38:15,811 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 945 transitions. Word has length 102 [2024-10-11 02:38:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:15,811 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 945 transitions. [2024-10-11 02:38:15,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 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-10-11 02:38:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 945 transitions. [2024-10-11 02:38:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:38:15,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:15,816 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:15,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:38:15,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:15,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:15,818 INFO L85 PathProgramCache]: Analyzing trace with hash -119111022, now seen corresponding path program 1 times [2024-10-11 02:38:15,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:15,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39091781] [2024-10-11 02:38:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:15,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:38:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:38:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:38:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:38:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:38:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:16,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39091781] [2024-10-11 02:38:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39091781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941054779] [2024-10-11 02:38:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:16,545 INFO L87 Difference]: Start difference. First operand 573 states and 945 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 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-10-11 02:38:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:23,132 INFO L93 Difference]: Finished difference Result 1469 states and 2505 transitions. [2024-10-11 02:38:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 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 103 [2024-10-11 02:38:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:23,139 INFO L225 Difference]: With dead ends: 1469 [2024-10-11 02:38:23,139 INFO L226 Difference]: Without dead ends: 884 [2024-10-11 02:38:23,142 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-10-11 02:38:23,143 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1112 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 5698 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 5970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:23,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2795 Invalid, 5970 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 5698 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 02:38:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-11 02:38:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 567. [2024-10-11 02:38:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 427 states have (on average 1.6604215456674474) internal successors, (709), 443 states have internal predecessors, (709), 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-10-11 02:38:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 932 transitions. [2024-10-11 02:38:23,284 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 932 transitions. Word has length 103 [2024-10-11 02:38:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 932 transitions. [2024-10-11 02:38:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 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-10-11 02:38:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 932 transitions. [2024-10-11 02:38:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:38:23,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:23,288 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:23,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:38:23,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:23,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash 598784455, now seen corresponding path program 1 times [2024-10-11 02:38:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645141071] [2024-10-11 02:38:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:38:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:38:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:38:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:38:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645141071] [2024-10-11 02:38:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645141071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996098156] [2024-10-11 02:38:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:23,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:23,970 INFO L87 Difference]: Start difference. First operand 567 states and 932 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 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-10-11 02:38:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:30,063 INFO L93 Difference]: Finished difference Result 1441 states and 2456 transitions. [2024-10-11 02:38:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 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 104 [2024-10-11 02:38:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:30,071 INFO L225 Difference]: With dead ends: 1441 [2024-10-11 02:38:30,071 INFO L226 Difference]: Without dead ends: 884 [2024-10-11 02:38:30,074 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-10-11 02:38:30,076 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 2142 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 5322 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 6036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 5322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:30,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 2827 Invalid, 6036 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [714 Valid, 5322 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:38:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-11 02:38:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 567. [2024-10-11 02:38:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 427 states have (on average 1.6580796252927401) internal successors, (708), 443 states have internal predecessors, (708), 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-10-11 02:38:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 931 transitions. [2024-10-11 02:38:30,224 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 931 transitions. Word has length 104 [2024-10-11 02:38:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:30,224 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 931 transitions. [2024-10-11 02:38:30,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 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-10-11 02:38:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 931 transitions. [2024-10-11 02:38:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:38:30,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:30,227 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:30,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:38:30,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1196056655, now seen corresponding path program 1 times [2024-10-11 02:38:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840797967] [2024-10-11 02:38:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:38:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:38:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:38:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:38:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:38:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:30,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840797967] [2024-10-11 02:38:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840797967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:30,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:30,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344515353] [2024-10-11 02:38:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:30,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:30,871 INFO L87 Difference]: Start difference. First operand 567 states and 931 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 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-10-11 02:38:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:37,289 INFO L93 Difference]: Finished difference Result 1457 states and 2474 transitions. [2024-10-11 02:38:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 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 105 [2024-10-11 02:38:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:37,295 INFO L225 Difference]: With dead ends: 1457 [2024-10-11 02:38:37,295 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 02:38:37,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:38:37,299 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1612 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 5514 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 5997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 5514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:37,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 2785 Invalid, 5997 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [483 Valid, 5514 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 02:38:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 02:38:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 561. [2024-10-11 02:38:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 421 states have (on average 1.6508313539192399) internal successors, (695), 437 states have internal predecessors, (695), 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-10-11 02:38:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 918 transitions. [2024-10-11 02:38:37,445 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 918 transitions. Word has length 105 [2024-10-11 02:38:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:37,446 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 918 transitions. [2024-10-11 02:38:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 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-10-11 02:38:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 918 transitions. [2024-10-11 02:38:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 02:38:37,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:37,450 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:37,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:38:37,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:37,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1976450408, now seen corresponding path program 1 times [2024-10-11 02:38:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:37,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213300132] [2024-10-11 02:38:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:37,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:38:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:38:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:38:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:38:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:38:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:38:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213300132] [2024-10-11 02:38:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213300132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:38,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815861984] [2024-10-11 02:38:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:38,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:38,073 INFO L87 Difference]: Start difference. First operand 561 states and 918 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 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-10-11 02:38:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:43,811 INFO L93 Difference]: Finished difference Result 1429 states and 2427 transitions. [2024-10-11 02:38:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 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 106 [2024-10-11 02:38:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:43,818 INFO L225 Difference]: With dead ends: 1429 [2024-10-11 02:38:43,818 INFO L226 Difference]: Without dead ends: 878 [2024-10-11 02:38:43,821 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-10-11 02:38:43,822 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1565 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 5278 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 5278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:43,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 2869 Invalid, 5777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 5278 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 02:38:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-11 02:38:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 561. [2024-10-11 02:38:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 421 states have (on average 1.6484560570071258) internal successors, (694), 437 states have internal predecessors, (694), 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-10-11 02:38:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 917 transitions. [2024-10-11 02:38:43,973 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 917 transitions. Word has length 106 [2024-10-11 02:38:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 917 transitions. [2024-10-11 02:38:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 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-10-11 02:38:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 917 transitions. [2024-10-11 02:38:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:38:43,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:43,976 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:43,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:38:43,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:43,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1554627603, now seen corresponding path program 1 times [2024-10-11 02:38:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965221954] [2024-10-11 02:38:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:38:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:38:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:38:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:38:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:38:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:38:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965221954] [2024-10-11 02:38:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965221954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:44,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583606275] [2024-10-11 02:38:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:44,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:44,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:44,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:44,567 INFO L87 Difference]: Start difference. First operand 561 states and 917 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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-10-11 02:38:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:50,647 INFO L93 Difference]: Finished difference Result 1445 states and 2443 transitions. [2024-10-11 02:38:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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 107 [2024-10-11 02:38:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:50,654 INFO L225 Difference]: With dead ends: 1445 [2024-10-11 02:38:50,654 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 02:38:50,656 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-10-11 02:38:50,657 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 2140 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 5276 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 5988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 5276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:50,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 2687 Invalid, 5988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 5276 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 02:38:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 02:38:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 555. [2024-10-11 02:38:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 415 states have (on average 1.6409638554216868) internal successors, (681), 431 states have internal predecessors, (681), 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-10-11 02:38:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 904 transitions. [2024-10-11 02:38:50,794 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 904 transitions. Word has length 107 [2024-10-11 02:38:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:50,794 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 904 transitions. [2024-10-11 02:38:50,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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-10-11 02:38:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 904 transitions. [2024-10-11 02:38:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:38:50,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:50,797 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:38:50,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:38:50,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1577439694, now seen corresponding path program 1 times [2024-10-11 02:38:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:50,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615025128] [2024-10-11 02:38:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:38:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:38:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:38:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:38:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:38:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:38:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615025128] [2024-10-11 02:38:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615025128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:51,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:51,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429642445] [2024-10-11 02:38:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:51,385 INFO L87 Difference]: Start difference. First operand 555 states and 904 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 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-10-11 02:38:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:55,812 INFO L93 Difference]: Finished difference Result 1417 states and 2398 transitions. [2024-10-11 02:38:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:38:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 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 107 [2024-10-11 02:38:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:55,817 INFO L225 Difference]: With dead ends: 1417 [2024-10-11 02:38:55,817 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 02:38:55,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-10-11 02:38:55,820 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 2042 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 700 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:55,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 1544 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:38:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 02:38:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 555. [2024-10-11 02:38:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 415 states have (on average 1.6385542168674698) internal successors, (680), 431 states have internal predecessors, (680), 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-10-11 02:38:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 903 transitions. [2024-10-11 02:38:55,966 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 903 transitions. Word has length 107 [2024-10-11 02:38:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:55,967 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 903 transitions. [2024-10-11 02:38:55,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 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-10-11 02:38:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 903 transitions. [2024-10-11 02:38:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:38:55,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:55,969 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:38:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:38:55,970 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash -400944048, now seen corresponding path program 1 times [2024-10-11 02:38:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723307142] [2024-10-11 02:38:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:38:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:38:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:38:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:38:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:38:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:38:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:38:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:38:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723307142] [2024-10-11 02:38:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723307142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:56,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:56,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399649139] [2024-10-11 02:38:56,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:56,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:56,578 INFO L87 Difference]: Start difference. First operand 555 states and 903 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 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-10-11 02:39:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:02,852 INFO L93 Difference]: Finished difference Result 1427 states and 2405 transitions. [2024-10-11 02:39:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:39:02,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 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 108 [2024-10-11 02:39:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:02,859 INFO L225 Difference]: With dead ends: 1427 [2024-10-11 02:39:02,859 INFO L226 Difference]: Without dead ends: 872 [2024-10-11 02:39:02,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:39:02,862 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1517 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 5286 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 5768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 5286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:02,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2920 Invalid, 5768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 5286 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:39:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-11 02:39:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 555. [2024-10-11 02:39:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 415 states have (on average 1.636144578313253) internal successors, (679), 431 states have internal predecessors, (679), 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-10-11 02:39:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 902 transitions. [2024-10-11 02:39:03,026 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 902 transitions. Word has length 108 [2024-10-11 02:39:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 902 transitions. [2024-10-11 02:39:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 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-10-11 02:39:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 902 transitions. [2024-10-11 02:39:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:39:03,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:03,029 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:39:03,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:39:03,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:03,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1673136378, now seen corresponding path program 1 times [2024-10-11 02:39:03,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:03,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445070341] [2024-10-11 02:39:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:39:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:39:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:39:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:39:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:39:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:39:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:39:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:39:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445070341] [2024-10-11 02:39:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445070341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:03,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978593239] [2024-10-11 02:39:03,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:03,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:03,632 INFO L87 Difference]: Start difference. First operand 555 states and 902 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (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)