./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:42:03,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:42:04,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:42:04,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:42:04,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:42:04,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:42:04,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:42:04,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:42:04,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:42:04,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:42:04,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:42:04,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:42:04,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:42:04,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:42:04,045 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:42:04,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:42:04,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:42:04,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:42:04,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:42:04,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:42:04,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:42:04,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:42:04,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:42:04,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:42:04,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:42:04,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:42:04,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:42:04,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:42:04,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:42:04,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:42:04,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:42:04,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:42:04,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:42:04,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:42:04,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:42:04,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:42:04,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:42:04,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:42:04,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:42:04,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:42:04,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:42:04,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:42:04,052 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2024-11-19 21:42:04,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:42:04,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:42:04,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:42:04,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:42:04,276 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:42:04,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2024-11-19 21:42:05,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:42:05,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:42:05,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2024-11-19 21:42:05,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a5988b3/95348251e99a46de9eaafd3d729f8d9f/FLAG1f65795f0 [2024-11-19 21:42:06,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a5988b3/95348251e99a46de9eaafd3d729f8d9f [2024-11-19 21:42:06,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:42:06,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:42:06,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:42:06,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:42:06,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:42:06,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad16d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06, skipping insertion in model container [2024-11-19 21:42:06,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:42:06,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2024-11-19 21:42:06,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:42:06,450 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:42:06,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2024-11-19 21:42:06,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [150] [2024-11-19 21:42:06,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [164] [2024-11-19 21:42:06,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [284] [2024-11-19 21:42:06,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [322] [2024-11-19 21:42:06,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1825] [2024-11-19 21:42:06,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1834] [2024-11-19 21:42:06,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2200] [2024-11-19 21:42:06,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2552] [2024-11-19 21:42:06,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2733] [2024-11-19 21:42:06,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2024-11-19 21:42:06,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:42:06,564 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:42:06,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06 WrapperNode [2024-11-19 21:42:06,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:42:06,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:42:06,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:42:06,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:42:06,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,623 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 816 [2024-11-19 21:42:06,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:42:06,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:42:06,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:42:06,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:42:06,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,664 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-19 21:42:06,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:42:06,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:42:06,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:42:06,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:42:06,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (1/1) ... [2024-11-19 21:42:06,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:42:06,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:42:06,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:42:06,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:42:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:42:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-19 21:42:06,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-19 21:42:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-19 21:42:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-19 21:42:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-19 21:42:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-19 21:42:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 21:42:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 21:42:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-19 21:42:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-19 21:42:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:42:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:42:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-19 21:42:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-19 21:42:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-19 21:42:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-19 21:42:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-19 21:42:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-19 21:42:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-19 21:42:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-19 21:42:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-19 21:42:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-19 21:42:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-19 21:42:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 21:42:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2024-11-19 21:42:06,775 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-19 21:42:06,775 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-19 21:42:06,775 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-19 21:42:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-19 21:42:06,775 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-19 21:42:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:42:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:42:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-19 21:42:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-19 21:42:06,913 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:42:06,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:42:07,843 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2024-11-19 21:42:07,844 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:42:07,875 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:42:07,879 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:42:07,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:07 BoogieIcfgContainer [2024-11-19 21:42:07,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:42:07,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:42:07,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:42:07,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:42:07,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:42:06" (1/3) ... [2024-11-19 21:42:07,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7547b62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:07, skipping insertion in model container [2024-11-19 21:42:07,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:06" (2/3) ... [2024-11-19 21:42:07,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7547b62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:07, skipping insertion in model container [2024-11-19 21:42:07,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:07" (3/3) ... [2024-11-19 21:42:07,887 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2024-11-19 21:42:07,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:42:07,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:42:07,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:42:07,959 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;@1311e207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:42:07,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:42:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 426 states have (on average 1.7065727699530517) internal successors, (727), 449 states have internal predecessors, (727), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 21:42:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 21:42:07,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:07,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:07,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash -481021737, now seen corresponding path program 1 times [2024-11-19 21:42:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448130225] [2024-11-19 21:42:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:42:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 21:42:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448130225] [2024-11-19 21:42:08,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448130225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:08,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222848894] [2024-11-19 21:42:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:08,939 INFO L87 Difference]: Start difference. First operand has 541 states, 426 states have (on average 1.7065727699530517) internal successors, (727), 449 states have internal predecessors, (727), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:12,526 INFO L93 Difference]: Finished difference Result 1224 states and 2085 transitions. [2024-11-19 21:42:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:42:12,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2024-11-19 21:42:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:12,546 INFO L225 Difference]: With dead ends: 1224 [2024-11-19 21:42:12,546 INFO L226 Difference]: Without dead ends: 695 [2024-11-19 21:42:12,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:12,555 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1090 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:12,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1181 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:42:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-19 21:42:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2024-11-19 21:42:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 441 states have internal predecessors, (715), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 892 transitions. [2024-11-19 21:42:12,689 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 892 transitions. Word has length 56 [2024-11-19 21:42:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:12,690 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 892 transitions. [2024-11-19 21:42:12,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 892 transitions. [2024-11-19 21:42:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 21:42:12,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:12,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:12,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:42:12,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:12,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1890375133, now seen corresponding path program 1 times [2024-11-19 21:42:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430160559] [2024-11-19 21:42:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:12,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 21:42:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:13,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430160559] [2024-11-19 21:42:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430160559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:13,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:13,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:13,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356386503] [2024-11-19 21:42:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:13,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:13,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:13,233 INFO L87 Difference]: Start difference. First operand 533 states and 892 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:16,424 INFO L93 Difference]: Finished difference Result 1210 states and 2051 transitions. [2024-11-19 21:42:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:42:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2024-11-19 21:42:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:16,428 INFO L225 Difference]: With dead ends: 1210 [2024-11-19 21:42:16,428 INFO L226 Difference]: Without dead ends: 695 [2024-11-19 21:42:16,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:16,431 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1090 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:16,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1138 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:42:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-19 21:42:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2024-11-19 21:42:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.7) internal successors, (714), 441 states have internal predecessors, (714), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 891 transitions. [2024-11-19 21:42:16,486 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 891 transitions. Word has length 59 [2024-11-19 21:42:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 891 transitions. [2024-11-19 21:42:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 891 transitions. [2024-11-19 21:42:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 21:42:16,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:16,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:16,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:42:16,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:16,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2145122521, now seen corresponding path program 1 times [2024-11-19 21:42:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122730022] [2024-11-19 21:42:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:16,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:42:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:42:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122730022] [2024-11-19 21:42:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122730022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:16,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667755819] [2024-11-19 21:42:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:16,950 INFO L87 Difference]: Start difference. First operand 533 states and 891 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:20,062 INFO L93 Difference]: Finished difference Result 1210 states and 2050 transitions. [2024-11-19 21:42:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:42:20,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2024-11-19 21:42:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:20,066 INFO L225 Difference]: With dead ends: 1210 [2024-11-19 21:42:20,067 INFO L226 Difference]: Without dead ends: 695 [2024-11-19 21:42:20,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:20,069 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 659 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:20,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1137 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:42:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-19 21:42:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2024-11-19 21:42:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6976190476190476) internal successors, (713), 441 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 890 transitions. [2024-11-19 21:42:20,136 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 890 transitions. Word has length 60 [2024-11-19 21:42:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:20,137 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 890 transitions. [2024-11-19 21:42:20,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 890 transitions. [2024-11-19 21:42:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 21:42:20,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:20,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:42:20,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:20,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1890778849, now seen corresponding path program 1 times [2024-11-19 21:42:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421232655] [2024-11-19 21:42:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:42:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:42:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421232655] [2024-11-19 21:42:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421232655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583506475] [2024-11-19 21:42:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:20,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:20,568 INFO L87 Difference]: Start difference. First operand 533 states and 890 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:23,670 INFO L93 Difference]: Finished difference Result 1210 states and 2049 transitions. [2024-11-19 21:42:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:42:23,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2024-11-19 21:42:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:23,674 INFO L225 Difference]: With dead ends: 1210 [2024-11-19 21:42:23,674 INFO L226 Difference]: Without dead ends: 695 [2024-11-19 21:42:23,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:23,676 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 656 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:23,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1146 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 21:42:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-19 21:42:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2024-11-19 21:42:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6952380952380952) internal successors, (712), 441 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 889 transitions. [2024-11-19 21:42:23,726 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 889 transitions. Word has length 61 [2024-11-19 21:42:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:23,727 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 889 transitions. [2024-11-19 21:42:23,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 889 transitions. [2024-11-19 21:42:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 21:42:23,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:23,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:42:23,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1260485795, now seen corresponding path program 1 times [2024-11-19 21:42:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288503943] [2024-11-19 21:42:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:42:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:42:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288503943] [2024-11-19 21:42:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288503943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:24,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912655617] [2024-11-19 21:42:24,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:24,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:24,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:24,138 INFO L87 Difference]: Start difference. First operand 533 states and 889 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:26,907 INFO L93 Difference]: Finished difference Result 1210 states and 2048 transitions. [2024-11-19 21:42:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:42:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2024-11-19 21:42:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:26,911 INFO L225 Difference]: With dead ends: 1210 [2024-11-19 21:42:26,911 INFO L226 Difference]: Without dead ends: 695 [2024-11-19 21:42:26,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:26,913 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1080 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:26,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1144 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 21:42:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-19 21:42:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2024-11-19 21:42:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6928571428571428) internal successors, (711), 441 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 888 transitions. [2024-11-19 21:42:26,961 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 888 transitions. Word has length 62 [2024-11-19 21:42:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:26,961 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 888 transitions. [2024-11-19 21:42:26,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 888 transitions. [2024-11-19 21:42:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 21:42:26,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:26,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:26,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:42:26,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1456327238, now seen corresponding path program 1 times [2024-11-19 21:42:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883455725] [2024-11-19 21:42:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:42:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883455725] [2024-11-19 21:42:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883455725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:27,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:27,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519185858] [2024-11-19 21:42:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:27,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:27,374 INFO L87 Difference]: Start difference. First operand 533 states and 888 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:30,256 INFO L93 Difference]: Finished difference Result 1182 states and 1989 transitions. [2024-11-19 21:42:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:42:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2024-11-19 21:42:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:30,260 INFO L225 Difference]: With dead ends: 1182 [2024-11-19 21:42:30,260 INFO L226 Difference]: Without dead ends: 707 [2024-11-19 21:42:30,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:30,262 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 715 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:30,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1179 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 21:42:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-19 21:42:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 533. [2024-11-19 21:42:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.680952380952381) internal successors, (706), 441 states have internal predecessors, (706), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 883 transitions. [2024-11-19 21:42:30,313 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 883 transitions. Word has length 63 [2024-11-19 21:42:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 883 transitions. [2024-11-19 21:42:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 883 transitions. [2024-11-19 21:42:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 21:42:30,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:30,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:30,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:42:30,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 53797837, now seen corresponding path program 1 times [2024-11-19 21:42:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703403142] [2024-11-19 21:42:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:42:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:30,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703403142] [2024-11-19 21:42:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703403142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:30,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240243630] [2024-11-19 21:42:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:30,682 INFO L87 Difference]: Start difference. First operand 533 states and 883 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:33,473 INFO L93 Difference]: Finished difference Result 1182 states and 1984 transitions. [2024-11-19 21:42:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:42:33,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2024-11-19 21:42:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:33,476 INFO L225 Difference]: With dead ends: 1182 [2024-11-19 21:42:33,476 INFO L226 Difference]: Without dead ends: 707 [2024-11-19 21:42:33,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:33,478 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 714 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:33,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1143 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 21:42:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-19 21:42:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 533. [2024-11-19 21:42:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6690476190476191) internal successors, (701), 441 states have internal predecessors, (701), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 878 transitions. [2024-11-19 21:42:33,526 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 878 transitions. Word has length 64 [2024-11-19 21:42:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:33,526 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 878 transitions. [2024-11-19 21:42:33,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 878 transitions. [2024-11-19 21:42:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 21:42:33,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:33,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:33,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:42:33,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:33,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash -695415713, now seen corresponding path program 1 times [2024-11-19 21:42:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:33,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641125196] [2024-11-19 21:42:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:42:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641125196] [2024-11-19 21:42:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641125196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310143051] [2024-11-19 21:42:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:33,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:33,897 INFO L87 Difference]: Start difference. First operand 533 states and 878 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:36,503 INFO L93 Difference]: Finished difference Result 1182 states and 1979 transitions. [2024-11-19 21:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:42:36,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2024-11-19 21:42:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:36,507 INFO L225 Difference]: With dead ends: 1182 [2024-11-19 21:42:36,507 INFO L226 Difference]: Without dead ends: 707 [2024-11-19 21:42:36,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:36,509 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1146 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:36,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1136 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 21:42:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-19 21:42:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 533. [2024-11-19 21:42:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 420 states have (on average 1.6571428571428573) internal successors, (696), 441 states have internal predecessors, (696), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 873 transitions. [2024-11-19 21:42:36,575 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 873 transitions. Word has length 65 [2024-11-19 21:42:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:36,575 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 873 transitions. [2024-11-19 21:42:36,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 873 transitions. [2024-11-19 21:42:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 21:42:36,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:36,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:36,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:42:36,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:36,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1447465613, now seen corresponding path program 1 times [2024-11-19 21:42:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931339414] [2024-11-19 21:42:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:42:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931339414] [2024-11-19 21:42:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931339414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990849422] [2024-11-19 21:42:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:36,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:36,957 INFO L87 Difference]: Start difference. First operand 533 states and 873 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:39,893 INFO L93 Difference]: Finished difference Result 1168 states and 1952 transitions. [2024-11-19 21:42:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:42:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2024-11-19 21:42:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:39,897 INFO L225 Difference]: With dead ends: 1168 [2024-11-19 21:42:39,897 INFO L226 Difference]: Without dead ends: 699 [2024-11-19 21:42:39,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:39,900 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 701 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:39,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1116 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 21:42:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-19 21:42:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 535. [2024-11-19 21:42:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6540284360189574) internal successors, (698), 443 states have internal predecessors, (698), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 875 transitions. [2024-11-19 21:42:39,964 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 875 transitions. Word has length 66 [2024-11-19 21:42:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:39,965 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 875 transitions. [2024-11-19 21:42:39,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 875 transitions. [2024-11-19 21:42:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 21:42:39,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:39,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:39,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:42:39,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:39,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1530317394, now seen corresponding path program 1 times [2024-11-19 21:42:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:39,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237411940] [2024-11-19 21:42:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:42:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:40,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237411940] [2024-11-19 21:42:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237411940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:40,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:40,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166267695] [2024-11-19 21:42:40,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:40,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:40,327 INFO L87 Difference]: Start difference. First operand 535 states and 875 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:43,062 INFO L93 Difference]: Finished difference Result 1188 states and 1979 transitions. [2024-11-19 21:42:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:42:43,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2024-11-19 21:42:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:43,066 INFO L225 Difference]: With dead ends: 1188 [2024-11-19 21:42:43,066 INFO L226 Difference]: Without dead ends: 711 [2024-11-19 21:42:43,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:43,068 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 712 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:43,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1130 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 21:42:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-19 21:42:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 535. [2024-11-19 21:42:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6421800947867298) internal successors, (693), 443 states have internal predecessors, (693), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 870 transitions. [2024-11-19 21:42:43,140 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 870 transitions. Word has length 66 [2024-11-19 21:42:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:43,140 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 870 transitions. [2024-11-19 21:42:43,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 870 transitions. [2024-11-19 21:42:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 21:42:43,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:43,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:43,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:42:43,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash -236840319, now seen corresponding path program 1 times [2024-11-19 21:42:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128090896] [2024-11-19 21:42:43,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:42:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128090896] [2024-11-19 21:42:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128090896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:43,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:43,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:42:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253974281] [2024-11-19 21:42:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:43,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:42:43,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:42:43,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:42:43,572 INFO L87 Difference]: Start difference. First operand 535 states and 870 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:42:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:47,318 INFO L93 Difference]: Finished difference Result 1182 states and 1964 transitions. [2024-11-19 21:42:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:42:47,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2024-11-19 21:42:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:47,322 INFO L225 Difference]: With dead ends: 1182 [2024-11-19 21:42:47,322 INFO L226 Difference]: Without dead ends: 713 [2024-11-19 21:42:47,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:42:47,324 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1131 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 4425 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 4425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:47,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 1979 Invalid, 4683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 4425 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 21:42:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-19 21:42:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 538. [2024-11-19 21:42:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 425 states have (on average 1.6376470588235295) internal successors, (696), 446 states have internal predecessors, (696), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 873 transitions. [2024-11-19 21:42:47,374 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 873 transitions. Word has length 67 [2024-11-19 21:42:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:47,374 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 873 transitions. [2024-11-19 21:42:47,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:42:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 873 transitions. [2024-11-19 21:42:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 21:42:47,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:47,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:47,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:42:47,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:47,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1490116356, now seen corresponding path program 1 times [2024-11-19 21:42:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541793134] [2024-11-19 21:42:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:42:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:47,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541793134] [2024-11-19 21:42:47,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541793134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:47,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070061586] [2024-11-19 21:42:47,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:47,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:47,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:47,770 INFO L87 Difference]: Start difference. First operand 538 states and 873 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:50,414 INFO L93 Difference]: Finished difference Result 1197 states and 1982 transitions. [2024-11-19 21:42:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:42:50,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2024-11-19 21:42:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:50,418 INFO L225 Difference]: With dead ends: 1197 [2024-11-19 21:42:50,418 INFO L226 Difference]: Without dead ends: 717 [2024-11-19 21:42:50,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:50,419 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 710 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:50,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1130 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 21:42:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-19 21:42:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 538. [2024-11-19 21:42:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 425 states have (on average 1.6258823529411766) internal successors, (691), 446 states have internal predecessors, (691), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 868 transitions. [2024-11-19 21:42:50,471 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 868 transitions. Word has length 67 [2024-11-19 21:42:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:50,471 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 868 transitions. [2024-11-19 21:42:50,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 868 transitions. [2024-11-19 21:42:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 21:42:50,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:50,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:50,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:42:50,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 286666936, now seen corresponding path program 1 times [2024-11-19 21:42:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777258633] [2024-11-19 21:42:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:42:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777258633] [2024-11-19 21:42:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777258633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:42:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147189797] [2024-11-19 21:42:50,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:50,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:42:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:42:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:42:50,883 INFO L87 Difference]: Start difference. First operand 538 states and 868 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:42:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:54,808 INFO L93 Difference]: Finished difference Result 1190 states and 1967 transitions. [2024-11-19 21:42:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:42:54,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2024-11-19 21:42:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:54,812 INFO L225 Difference]: With dead ends: 1190 [2024-11-19 21:42:54,812 INFO L226 Difference]: Without dead ends: 721 [2024-11-19 21:42:54,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:42:54,814 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 693 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 4538 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 4660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:54,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2051 Invalid, 4660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 4538 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:42:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-19 21:42:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 542. [2024-11-19 21:42:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.6200466200466201) internal successors, (695), 450 states have internal predecessors, (695), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 872 transitions. [2024-11-19 21:42:54,865 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 872 transitions. Word has length 68 [2024-11-19 21:42:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:54,865 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 872 transitions. [2024-11-19 21:42:54,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:42:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 872 transitions. [2024-11-19 21:42:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 21:42:54,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:54,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:42:54,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash -74566441, now seen corresponding path program 1 times [2024-11-19 21:42:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451548684] [2024-11-19 21:42:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:42:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451548684] [2024-11-19 21:42:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451548684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:55,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:42:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578396164] [2024-11-19 21:42:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:42:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:42:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:42:55,238 INFO L87 Difference]: Start difference. First operand 542 states and 872 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:58,021 INFO L93 Difference]: Finished difference Result 1237 states and 2024 transitions. [2024-11-19 21:42:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:42:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-11-19 21:42:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:58,025 INFO L225 Difference]: With dead ends: 1237 [2024-11-19 21:42:58,025 INFO L226 Difference]: Without dead ends: 713 [2024-11-19 21:42:58,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:42:58,026 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 653 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:58,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1131 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 21:42:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-19 21:42:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 542. [2024-11-19 21:42:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 450 states have internal predecessors, (694), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:42:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 871 transitions. [2024-11-19 21:42:58,080 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 871 transitions. Word has length 68 [2024-11-19 21:42:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:58,080 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 871 transitions. [2024-11-19 21:42:58,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:42:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 871 transitions. [2024-11-19 21:42:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 21:42:58,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:58,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:42:58,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:42:58,084 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1207757034, now seen corresponding path program 1 times [2024-11-19 21:42:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:58,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550418614] [2024-11-19 21:42:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:42:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:42:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:42:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:58,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550418614] [2024-11-19 21:42:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550418614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:58,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:58,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:42:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843020256] [2024-11-19 21:42:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:58,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:42:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:42:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:42:58,535 INFO L87 Difference]: Start difference. First operand 542 states and 871 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:43:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:02,919 INFO L93 Difference]: Finished difference Result 1193 states and 1968 transitions. [2024-11-19 21:43:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:43:02,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2024-11-19 21:43:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:02,923 INFO L225 Difference]: With dead ends: 1193 [2024-11-19 21:43:02,923 INFO L226 Difference]: Without dead ends: 703 [2024-11-19 21:43:02,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-19 21:43:02,924 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 705 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 5918 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 6039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 5918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:02,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 2639 Invalid, 6039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 5918 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:43:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-19 21:43:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 534. [2024-11-19 21:43:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.6223277909738718) internal successors, (683), 442 states have internal predecessors, (683), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:43:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 860 transitions. [2024-11-19 21:43:02,990 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 860 transitions. Word has length 68 [2024-11-19 21:43:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:02,990 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 860 transitions. [2024-11-19 21:43:02,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:43:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 860 transitions. [2024-11-19 21:43:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 21:43:02,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:02,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:43:02,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:43:02,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash 215181447, now seen corresponding path program 1 times [2024-11-19 21:43:02,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:02,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316018151] [2024-11-19 21:43:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:43:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:43:03,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:03,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316018151] [2024-11-19 21:43:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316018151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:03,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:03,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:43:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743248823] [2024-11-19 21:43:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:03,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:43:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:43:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:43:03,415 INFO L87 Difference]: Start difference. First operand 534 states and 860 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:43:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:07,084 INFO L93 Difference]: Finished difference Result 1182 states and 1951 transitions. [2024-11-19 21:43:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:43:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2024-11-19 21:43:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:07,088 INFO L225 Difference]: With dead ends: 1182 [2024-11-19 21:43:07,088 INFO L226 Difference]: Without dead ends: 713 [2024-11-19 21:43:07,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:43:07,090 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1098 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4321 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 4579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 4321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:07,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1966 Invalid, 4579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 4321 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:43:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-19 21:43:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 539. [2024-11-19 21:43:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 426 states have (on average 1.6150234741784038) internal successors, (688), 447 states have internal predecessors, (688), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:43:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 865 transitions. [2024-11-19 21:43:07,145 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 865 transitions. Word has length 69 [2024-11-19 21:43:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:07,145 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 865 transitions. [2024-11-19 21:43:07,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:43:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 865 transitions. [2024-11-19 21:43:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 21:43:07,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:07,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:43:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:43:07,146 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1063227830, now seen corresponding path program 1 times [2024-11-19 21:43:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080929076] [2024-11-19 21:43:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:43:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:43:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:07,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080929076] [2024-11-19 21:43:07,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080929076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:07,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:07,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:43:07,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283824340] [2024-11-19 21:43:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:07,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:43:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:43:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:43:07,550 INFO L87 Difference]: Start difference. First operand 539 states and 865 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:43:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:10,185 INFO L93 Difference]: Finished difference Result 1194 states and 1962 transitions. [2024-11-19 21:43:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2024-11-19 21:43:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:10,189 INFO L225 Difference]: With dead ends: 1194 [2024-11-19 21:43:10,189 INFO L226 Difference]: Without dead ends: 704 [2024-11-19 21:43:10,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:43:10,190 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1110 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:10,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1139 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 21:43:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-19 21:43:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 539. [2024-11-19 21:43:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 426 states have (on average 1.6056338028169015) internal successors, (684), 447 states have internal predecessors, (684), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 21:43:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 861 transitions. [2024-11-19 21:43:10,244 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 861 transitions. Word has length 70 [2024-11-19 21:43:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:10,244 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 861 transitions. [2024-11-19 21:43:10,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 21:43:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 861 transitions. [2024-11-19 21:43:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 21:43:10,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:10,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:43:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:43:10,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:10,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 308579468, now seen corresponding path program 1 times [2024-11-19 21:43:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206272608] [2024-11-19 21:43:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:43:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:43:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206272608] [2024-11-19 21:43:10,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206272608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:43:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147459957] [2024-11-19 21:43:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:43:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:43:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:43:10,770 INFO L87 Difference]: Start difference. First operand 539 states and 861 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:43:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:15,891 INFO L93 Difference]: Finished difference Result 1959 states and 3314 transitions. [2024-11-19 21:43:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:43:15,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2024-11-19 21:43:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:15,898 INFO L225 Difference]: With dead ends: 1959 [2024-11-19 21:43:15,898 INFO L226 Difference]: Without dead ends: 1498 [2024-11-19 21:43:15,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:43:15,900 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 4176 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 1081 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 4622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:15,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 1652 Invalid, 4622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 3541 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-19 21:43:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-19 21:43:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1021. [2024-11-19 21:43:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 809 states have (on average 1.6489493201483312) internal successors, (1334), 839 states have internal predecessors, (1334), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2024-11-19 21:43:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1684 transitions. [2024-11-19 21:43:16,023 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1684 transitions. Word has length 70 [2024-11-19 21:43:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1684 transitions. [2024-11-19 21:43:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 21:43:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1684 transitions. [2024-11-19 21:43:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:43:16,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:16,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:43:16,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:43:16,025 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:16,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -806032662, now seen corresponding path program 1 times [2024-11-19 21:43:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393198778] [2024-11-19 21:43:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:43:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:43:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 21:43:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:43:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393198778] [2024-11-19 21:43:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393198778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:43:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737920298] [2024-11-19 21:43:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:16,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:43:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:43:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:43:16,937 INFO L87 Difference]: Start difference. First operand 1021 states and 1684 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:43:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:21,793 INFO L93 Difference]: Finished difference Result 2474 states and 4187 transitions. [2024-11-19 21:43:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:43:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 99 [2024-11-19 21:43:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:21,800 INFO L225 Difference]: With dead ends: 2474 [2024-11-19 21:43:21,800 INFO L226 Difference]: Without dead ends: 1532 [2024-11-19 21:43:21,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:43:21,803 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 3630 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 1124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3630 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 4663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1124 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:21,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3630 Valid, 1975 Invalid, 4663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1124 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:43:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-19 21:43:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1029. [2024-11-19 21:43:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 815 states have (on average 1.6441717791411044) internal successors, (1340), 845 states have internal predecessors, (1340), 174 states have call successors, (174), 36 states have call predecessors, (174), 39 states have return successors, (180), 160 states have call predecessors, (180), 169 states have call successors, (180) [2024-11-19 21:43:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1694 transitions. [2024-11-19 21:43:21,984 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1694 transitions. Word has length 99 [2024-11-19 21:43:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:21,985 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1694 transitions. [2024-11-19 21:43:21,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:43:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1694 transitions. [2024-11-19 21:43:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 21:43:21,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:21,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:43:21,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:43:21,989 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:21,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash -350500354, now seen corresponding path program 1 times [2024-11-19 21:43:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140908299] [2024-11-19 21:43:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:43:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:43:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:43:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:43:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:43:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:22,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140908299] [2024-11-19 21:43:22,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140908299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:43:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872504354] [2024-11-19 21:43:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:22,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:43:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:43:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:43:22,877 INFO L87 Difference]: Start difference. First operand 1029 states and 1694 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:43:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:28,804 INFO L93 Difference]: Finished difference Result 2985 states and 5082 transitions. [2024-11-19 21:43:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 21:43:28,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2024-11-19 21:43:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:28,813 INFO L225 Difference]: With dead ends: 2985 [2024-11-19 21:43:28,813 INFO L226 Difference]: Without dead ends: 2035 [2024-11-19 21:43:28,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:43:28,816 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 2280 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 5859 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2321 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 5859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:28,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2321 Valid, 2711 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 5859 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-19 21:43:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-11-19 21:43:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1439. [2024-11-19 21:43:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1134 states have (on average 1.6181657848324515) internal successors, (1835), 1168 states have internal predecessors, (1835), 247 states have call successors, (247), 47 states have call predecessors, (247), 57 states have return successors, (287), 234 states have call predecessors, (287), 242 states have call successors, (287) [2024-11-19 21:43:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2369 transitions. [2024-11-19 21:43:29,070 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2369 transitions. Word has length 102 [2024-11-19 21:43:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:29,070 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2369 transitions. [2024-11-19 21:43:29,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:43:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2369 transitions. [2024-11-19 21:43:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 21:43:29,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:29,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:43:29,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:43:29,074 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1550930972, now seen corresponding path program 1 times [2024-11-19 21:43:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199712323] [2024-11-19 21:43:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:43:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:43:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:43:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-19 21:43:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:43:29,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:29,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199712323] [2024-11-19 21:43:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199712323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:29,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:29,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 21:43:29,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75210845] [2024-11-19 21:43:29,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:29,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 21:43:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 21:43:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-19 21:43:29,924 INFO L87 Difference]: Start difference. First operand 1439 states and 2369 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 13 states have internal predecessors, (84), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10)