./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_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_product20.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 e1240a0d3e559b8971965b03cecb352351a22be921567ab044722f9bb2872bc1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:44:44,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:44:44,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:44:44,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:44:44,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:44:44,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:44:44,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:44:44,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:44:44,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:44:44,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:44:44,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:44:44,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:44:44,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:44:44,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:44:44,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:44:44,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:44:44,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:44:44,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:44:44,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:44:44,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:44:44,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:44:44,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:44:44,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:44:44,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:44:44,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:44:44,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:44:44,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:44:44,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:44:44,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:44:44,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:44:44,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:44:44,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:44:44,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:44:44,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:44:44,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:44:44,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:44:44,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:44:44,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:44:44,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:44:44,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:44:44,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:44:44,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:44:44,187 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 -> e1240a0d3e559b8971965b03cecb352351a22be921567ab044722f9bb2872bc1 [2024-10-14 02:44:44,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:44:44,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:44:44,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:44:44,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:44:44,426 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:44:44,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c [2024-10-14 02:44:45,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:44:45,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:44:45,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c [2024-10-14 02:44:45,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c8cdfa6/3459186888224bc0aaaa758c19ae8bb7/FLAG1060002cf [2024-10-14 02:44:46,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c8cdfa6/3459186888224bc0aaaa758c19ae8bb7 [2024-10-14 02:44:46,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:44:46,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:44:46,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:44:46,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:44:46,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:44:46,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186a99a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46, skipping insertion in model container [2024-10-14 02:44:46,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:44:46,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c[38445,38458] [2024-10-14 02:44:46,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:44:46,617 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:44:46,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2024-10-14 02:44:46,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [236] [2024-10-14 02:44:46,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1824] [2024-10-14 02:44:46,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1833] [2024-10-14 02:44:46,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2199] [2024-10-14 02:44:46,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2861] [2024-10-14 02:44:46,627 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2875] [2024-10-14 02:44:46,627 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2913] [2024-10-14 02:44:46,627 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3006] [2024-10-14 02:44:46,627 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3356] [2024-10-14 02:44:46,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c[38445,38458] [2024-10-14 02:44:46,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:44:46,736 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:44:46,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46 WrapperNode [2024-10-14 02:44:46,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:44:46,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:44:46,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:44:46,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:44:46,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,825 INFO L138 Inliner]: procedures = 96, calls = 346, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 1133 [2024-10-14 02:44:46,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:44:46,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:44:46,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:44:46,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:44:46,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,878 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:44:46,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:44:46,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:44:46,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:44:46,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:44:46,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (1/1) ... [2024-10-14 02:44:46,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:44:46,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:44:46,978 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-10-14 02:44:46,981 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-10-14 02:44:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:44:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:44:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:44:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:44:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:44:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-14 02:44:47,051 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-14 02:44:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:44:47,051 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:44:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:44:47,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:44:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:44:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:44:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:44:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:44:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:44:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:44:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:44:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:44:47,056 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:44:47,056 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:44:47,057 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:44:47,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:44:47,057 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:44:47,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:44:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:44:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:44:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:44:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:44:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:44:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:44:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:44:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:44:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:44:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:44:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:44:47,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:44:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-14 02:44:47,065 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-14 02:44:47,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:44:47,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:44:48,155 INFO L? ?]: Removed 451 outVars from TransFormulas that were not future-live. [2024-10-14 02:44:48,156 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:44:48,228 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:44:48,228 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:44:48,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:44:48 BoogieIcfgContainer [2024-10-14 02:44:48,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:44:48,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:44:48,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:44:48,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:44:48,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:44:46" (1/3) ... [2024-10-14 02:44:48,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336ee2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:44:48, skipping insertion in model container [2024-10-14 02:44:48,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:44:46" (2/3) ... [2024-10-14 02:44:48,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336ee2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:44:48, skipping insertion in model container [2024-10-14 02:44:48,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:44:48" (3/3) ... [2024-10-14 02:44:48,238 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product20.cil.c [2024-10-14 02:44:48,250 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:44:48,250 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:44:48,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:44:48,333 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;@22b80c7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:44:48,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:44:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 421 states have (on average 1.7220902612826603) internal successors, (725), 444 states have internal predecessors, (725), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-14 02:44:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 02:44:48,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:44:48,353 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] [2024-10-14 02:44:48,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:44:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:44:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -255245996, now seen corresponding path program 1 times [2024-10-14 02:44:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:44:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552912437] [2024-10-14 02:44:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:44:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:44:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:44:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:44:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:44:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:49,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:44:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:44:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:44:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552912437] [2024-10-14 02:44:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552912437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:44:49,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:44:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:44:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250692110] [2024-10-14 02:44:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:44:49,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:44:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:44:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:44:49,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:44:49,324 INFO L87 Difference]: Start difference. First operand has 547 states, 421 states have (on average 1.7220902612826603) internal successors, (725), 444 states have internal predecessors, (725), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:44:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:44:53,277 INFO L93 Difference]: Finished difference Result 1239 states and 2117 transitions. [2024-10-14 02:44:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:44:53,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-14 02:44:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:44:53,297 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 02:44:53,297 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 02:44:53,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-10-14 02:44:53,309 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 674 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:44:53,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1074 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:44:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 02:44:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-14 02:44:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.7112171837708832) internal successors, (717), 440 states have internal predecessors, (717), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:44:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 910 transitions. [2024-10-14 02:44:53,431 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 910 transitions. Word has length 50 [2024-10-14 02:44:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:44:53,431 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 910 transitions. [2024-10-14 02:44:53,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:44:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 910 transitions. [2024-10-14 02:44:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 02:44:53,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:44:53,434 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] [2024-10-14 02:44:53,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:44:53,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:44:53,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:44:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1426460899, now seen corresponding path program 1 times [2024-10-14 02:44:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:44:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636709725] [2024-10-14 02:44:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:44:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:44:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:44:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:44:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:44:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:44:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:44:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:44:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636709725] [2024-10-14 02:44:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636709725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:44:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:44:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:44:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354885573] [2024-10-14 02:44:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:44:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:44:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:44:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:44:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:44:53,934 INFO L87 Difference]: Start difference. First operand 543 states and 910 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:44:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:44:57,360 INFO L93 Difference]: Finished difference Result 1232 states and 2090 transitions. [2024-10-14 02:44:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:44:57,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-10-14 02:44:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:44:57,365 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 02:44:57,365 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 02:44:57,369 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-10-14 02:44:57,370 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 673 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:44:57,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1062 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:44:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 02:44:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-14 02:44:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.7088305489260143) internal successors, (716), 440 states have internal predecessors, (716), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:44:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 909 transitions. [2024-10-14 02:44:57,435 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 909 transitions. Word has length 52 [2024-10-14 02:44:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:44:57,435 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 909 transitions. [2024-10-14 02:44:57,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:44:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 909 transitions. [2024-10-14 02:44:57,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 02:44:57,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:44:57,437 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] [2024-10-14 02:44:57,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:44:57,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:44:57,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:44:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1923621859, now seen corresponding path program 1 times [2024-10-14 02:44:57,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:44:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47132105] [2024-10-14 02:44:57,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:44:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:44:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:44:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:44:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:44:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:44:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:44:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:44:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:44:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:44:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47132105] [2024-10-14 02:44:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47132105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:44:57,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:44:57,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:44:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791140463] [2024-10-14 02:44:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:44:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:44:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:44:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:44:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:44:57,920 INFO L87 Difference]: Start difference. First operand 543 states and 909 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:01,199 INFO L93 Difference]: Finished difference Result 1232 states and 2089 transitions. [2024-10-14 02:45:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:45:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-14 02:45:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:01,204 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 02:45:01,205 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 02:45:01,206 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-10-14 02:45:01,207 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 671 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:01,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1086 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 02:45:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 02:45:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-14 02:45:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.7064439140811456) internal successors, (715), 440 states have internal predecessors, (715), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 908 transitions. [2024-10-14 02:45:01,281 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 908 transitions. Word has length 53 [2024-10-14 02:45:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:01,281 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 908 transitions. [2024-10-14 02:45:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 908 transitions. [2024-10-14 02:45:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:45:01,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:01,283 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] [2024-10-14 02:45:01,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:45:01,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:01,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash -909999577, now seen corresponding path program 1 times [2024-10-14 02:45:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:01,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645231831] [2024-10-14 02:45:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:45:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:45:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645231831] [2024-10-14 02:45:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645231831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362703535] [2024-10-14 02:45:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:01,709 INFO L87 Difference]: Start difference. First operand 543 states and 908 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:05,078 INFO L93 Difference]: Finished difference Result 1232 states and 2088 transitions. [2024-10-14 02:45:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:45:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-14 02:45:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:05,083 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 02:45:05,083 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 02:45:05,086 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-10-14 02:45:05,086 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 668 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:05,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1092 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:45:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 02:45:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-14 02:45:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.704057279236277) internal successors, (714), 440 states have internal predecessors, (714), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 907 transitions. [2024-10-14 02:45:05,148 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 907 transitions. Word has length 54 [2024-10-14 02:45:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 907 transitions. [2024-10-14 02:45:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 907 transitions. [2024-10-14 02:45:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 02:45:05,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:05,149 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] [2024-10-14 02:45:05,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:45:05,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:05,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2060474527, now seen corresponding path program 1 times [2024-10-14 02:45:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:05,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334217326] [2024-10-14 02:45:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:45:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:45:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334217326] [2024-10-14 02:45:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334217326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:05,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:05,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913130871] [2024-10-14 02:45:05,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:05,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:05,560 INFO L87 Difference]: Start difference. First operand 543 states and 907 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:08,707 INFO L93 Difference]: Finished difference Result 1232 states and 2087 transitions. [2024-10-14 02:45:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:45:08,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-10-14 02:45:08,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:08,712 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 02:45:08,712 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 02:45:08,713 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-10-14 02:45:08,714 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 666 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:08,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1071 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:45:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 02:45:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 543. [2024-10-14 02:45:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.701670644391408) internal successors, (713), 440 states have internal predecessors, (713), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 906 transitions. [2024-10-14 02:45:08,771 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 906 transitions. Word has length 55 [2024-10-14 02:45:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:08,772 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 906 transitions. [2024-10-14 02:45:08,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 906 transitions. [2024-10-14 02:45:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 02:45:08,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:08,773 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-10-14 02:45:08,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:45:08,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:08,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1578486933, now seen corresponding path program 1 times [2024-10-14 02:45:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:08,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893808210] [2024-10-14 02:45:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:09,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:45:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:09,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893808210] [2024-10-14 02:45:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893808210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:09,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088081989] [2024-10-14 02:45:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:09,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:09,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:09,203 INFO L87 Difference]: Start difference. First operand 543 states and 906 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:12,161 INFO L93 Difference]: Finished difference Result 1202 states and 2026 transitions. [2024-10-14 02:45:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:45:12,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2024-10-14 02:45:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:12,165 INFO L225 Difference]: With dead ends: 1202 [2024-10-14 02:45:12,165 INFO L226 Difference]: Without dead ends: 711 [2024-10-14 02:45:12,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:45:12,167 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 726 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:12,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1086 Invalid, 2822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:45:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-14 02:45:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 543. [2024-10-14 02:45:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.6897374701670644) internal successors, (708), 440 states have internal predecessors, (708), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 901 transitions. [2024-10-14 02:45:12,224 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 901 transitions. Word has length 56 [2024-10-14 02:45:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 901 transitions. [2024-10-14 02:45:12,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 901 transitions. [2024-10-14 02:45:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:45:12,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:12,226 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] [2024-10-14 02:45:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:45:12,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -253369053, now seen corresponding path program 1 times [2024-10-14 02:45:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945626709] [2024-10-14 02:45:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:45:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:12,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945626709] [2024-10-14 02:45:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945626709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925690201] [2024-10-14 02:45:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:12,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:12,694 INFO L87 Difference]: Start difference. First operand 543 states and 901 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:15,425 INFO L93 Difference]: Finished difference Result 1202 states and 2021 transitions. [2024-10-14 02:45:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:45:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-14 02:45:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:15,430 INFO L225 Difference]: With dead ends: 1202 [2024-10-14 02:45:15,430 INFO L226 Difference]: Without dead ends: 711 [2024-10-14 02:45:15,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-10-14 02:45:15,431 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1166 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:15,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1084 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:45:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-14 02:45:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 543. [2024-10-14 02:45:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 419 states have (on average 1.6778042959427208) internal successors, (703), 440 states have internal predecessors, (703), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 896 transitions. [2024-10-14 02:45:15,489 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 896 transitions. Word has length 57 [2024-10-14 02:45:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:15,490 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 896 transitions. [2024-10-14 02:45:15,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 896 transitions. [2024-10-14 02:45:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:45:15,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:15,493 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] [2024-10-14 02:45:15,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:45:15,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:15,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1744664966, now seen corresponding path program 1 times [2024-10-14 02:45:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579094127] [2024-10-14 02:45:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:45:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579094127] [2024-10-14 02:45:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579094127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:15,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:45:15,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696174531] [2024-10-14 02:45:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:45:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:15,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:45:15,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:45:15,955 INFO L87 Difference]: Start difference. First operand 543 states and 896 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:45:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:20,224 INFO L93 Difference]: Finished difference Result 1208 states and 2026 transitions. [2024-10-14 02:45:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:45:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 02:45:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:20,230 INFO L225 Difference]: With dead ends: 1208 [2024-10-14 02:45:20,230 INFO L226 Difference]: Without dead ends: 725 [2024-10-14 02:45:20,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:45:20,233 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1185 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:20,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1945 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:45:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-14 02:45:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 555. [2024-10-14 02:45:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.675233644859813) internal successors, (717), 451 states have internal predecessors, (717), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 914 transitions. [2024-10-14 02:45:20,314 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 914 transitions. Word has length 58 [2024-10-14 02:45:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:20,314 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 914 transitions. [2024-10-14 02:45:20,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:45:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 914 transitions. [2024-10-14 02:45:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:45:20,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:20,315 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] [2024-10-14 02:45:20,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:45:20,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:20,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash -579362873, now seen corresponding path program 1 times [2024-10-14 02:45:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:20,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50659888] [2024-10-14 02:45:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:45:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:20,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-10-14 02:45:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50659888] [2024-10-14 02:45:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50659888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386185054] [2024-10-14 02:45:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:20,682 INFO L87 Difference]: Start difference. First operand 555 states and 914 transitions. 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:23,386 INFO L93 Difference]: Finished difference Result 1230 states and 2064 transitions. [2024-10-14 02:45:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:45:23,386 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 02:45:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:23,390 INFO L225 Difference]: With dead ends: 1230 [2024-10-14 02:45:23,390 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 02:45:23,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:45:23,392 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1166 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:23,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1078 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:45:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 02:45:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 555. [2024-10-14 02:45:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.6635514018691588) internal successors, (712), 451 states have internal predecessors, (712), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 909 transitions. [2024-10-14 02:45:23,454 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 909 transitions. Word has length 58 [2024-10-14 02:45:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:23,455 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 909 transitions. [2024-10-14 02:45:23,455 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 909 transitions. [2024-10-14 02:45:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:45:23,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:23,456 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-10-14 02:45:23,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:45:23,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:23,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1955498659, now seen corresponding path program 1 times [2024-10-14 02:45:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831631346] [2024-10-14 02:45:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:45:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831631346] [2024-10-14 02:45:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831631346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:45:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909121210] [2024-10-14 02:45:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:23,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:45:23,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:45:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:45:23,916 INFO L87 Difference]: Start difference. First operand 555 states and 909 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:45:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:28,041 INFO L93 Difference]: Finished difference Result 1210 states and 2022 transitions. [2024-10-14 02:45:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:45:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-14 02:45:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:28,045 INFO L225 Difference]: With dead ends: 1210 [2024-10-14 02:45:28,045 INFO L226 Difference]: Without dead ends: 725 [2024-10-14 02:45:28,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 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-10-14 02:45:28,047 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 712 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 4851 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 4979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:28,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1889 Invalid, 4979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4851 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:45:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-14 02:45:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 555. [2024-10-14 02:45:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.661214953271028) internal successors, (711), 451 states have internal predecessors, (711), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 908 transitions. [2024-10-14 02:45:28,108 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 908 transitions. Word has length 59 [2024-10-14 02:45:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 908 transitions. [2024-10-14 02:45:28,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:45:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 908 transitions. [2024-10-14 02:45:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:45:28,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:28,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:45:28,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -197123459, now seen corresponding path program 1 times [2024-10-14 02:45:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288589166] [2024-10-14 02:45:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:45:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288589166] [2024-10-14 02:45:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288589166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:28,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:28,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383443639] [2024-10-14 02:45:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:28,487 INFO L87 Difference]: Start difference. First operand 555 states and 908 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:31,224 INFO L93 Difference]: Finished difference Result 1230 states and 2055 transitions. [2024-10-14 02:45:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:45:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 02:45:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:31,229 INFO L225 Difference]: With dead ends: 1230 [2024-10-14 02:45:31,229 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 02:45:31,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-10-14 02:45:31,231 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1166 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:31,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1065 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:45:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 02:45:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 555. [2024-10-14 02:45:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.6495327102803738) internal successors, (706), 451 states have internal predecessors, (706), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 903 transitions. [2024-10-14 02:45:31,313 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 903 transitions. Word has length 59 [2024-10-14 02:45:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:31,314 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 903 transitions. [2024-10-14 02:45:31,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 903 transitions. [2024-10-14 02:45:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:45:31,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:31,315 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-10-14 02:45:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:45:31,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1341574276, now seen corresponding path program 1 times [2024-10-14 02:45:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039858639] [2024-10-14 02:45:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039858639] [2024-10-14 02:45:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039858639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:45:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053840877] [2024-10-14 02:45:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:45:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:45:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:45:31,748 INFO L87 Difference]: Start difference. First operand 555 states and 903 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:45:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:35,888 INFO L93 Difference]: Finished difference Result 1218 states and 2025 transitions. [2024-10-14 02:45:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:45:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-10-14 02:45:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:35,891 INFO L225 Difference]: With dead ends: 1218 [2024-10-14 02:45:35,892 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 02:45:35,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 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-10-14 02:45:35,893 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 711 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 4778 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:35,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1901 Invalid, 4906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4778 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:45:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 02:45:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 558. [2024-10-14 02:45:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 431 states have (on average 1.642691415313225) internal successors, (708), 454 states have internal predecessors, (708), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 905 transitions. [2024-10-14 02:45:35,955 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 905 transitions. Word has length 60 [2024-10-14 02:45:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 905 transitions. [2024-10-14 02:45:35,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:45:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 905 transitions. [2024-10-14 02:45:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:45:35,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:35,959 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-10-14 02:45:35,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:45:35,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1658518110, now seen corresponding path program 1 times [2024-10-14 02:45:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:35,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004559333] [2024-10-14 02:45:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:45:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004559333] [2024-10-14 02:45:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004559333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300347259] [2024-10-14 02:45:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:36,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:36,331 INFO L87 Difference]: Start difference. First operand 558 states and 905 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:39,205 INFO L93 Difference]: Finished difference Result 1239 states and 2055 transitions. [2024-10-14 02:45:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:45:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-14 02:45:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:39,209 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 02:45:39,209 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 02:45:39,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-10-14 02:45:39,211 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 719 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:39,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1047 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:45:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 02:45:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 558. [2024-10-14 02:45:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 431 states have (on average 1.631090487238979) internal successors, (703), 454 states have internal predecessors, (703), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 900 transitions. [2024-10-14 02:45:39,275 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 900 transitions. Word has length 60 [2024-10-14 02:45:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:39,275 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 900 transitions. [2024-10-14 02:45:39,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 900 transitions. [2024-10-14 02:45:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:45:39,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:39,276 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-10-14 02:45:39,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:45:39,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:39,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1633186840, now seen corresponding path program 1 times [2024-10-14 02:45:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:39,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268350999] [2024-10-14 02:45:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:45:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268350999] [2024-10-14 02:45:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268350999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193308467] [2024-10-14 02:45:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:39,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:39,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:39,678 INFO L87 Difference]: Start difference. First operand 558 states and 900 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:42,474 INFO L93 Difference]: Finished difference Result 1222 states and 2022 transitions. [2024-10-14 02:45:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:45:42,475 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-14 02:45:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:42,478 INFO L225 Difference]: With dead ends: 1222 [2024-10-14 02:45:42,478 INFO L226 Difference]: Without dead ends: 735 [2024-10-14 02:45:42,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-10-14 02:45:42,479 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1146 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:42,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1023 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 02:45:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-14 02:45:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 562. [2024-10-14 02:45:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 435 states have (on average 1.6229885057471265) internal successors, (706), 458 states have internal predecessors, (706), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-14 02:45:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 903 transitions. [2024-10-14 02:45:42,543 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 903 transitions. Word has length 61 [2024-10-14 02:45:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:42,543 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 903 transitions. [2024-10-14 02:45:42,543 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 903 transitions. [2024-10-14 02:45:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:45:42,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:42,544 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-10-14 02:45:42,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:45:42,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:42,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -143026632, now seen corresponding path program 1 times [2024-10-14 02:45:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464795526] [2024-10-14 02:45:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:45:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464795526] [2024-10-14 02:45:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464795526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:42,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:42,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096510535] [2024-10-14 02:45:42,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:42,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:42,903 INFO L87 Difference]: Start difference. First operand 562 states and 903 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:45,725 INFO L93 Difference]: Finished difference Result 1277 states and 2085 transitions. [2024-10-14 02:45:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:45:45,726 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-14 02:45:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:45,730 INFO L225 Difference]: With dead ends: 1277 [2024-10-14 02:45:45,730 INFO L226 Difference]: Without dead ends: 709 [2024-10-14 02:45:45,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-10-14 02:45:45,731 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1103 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:45,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1039 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 02:45:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-10-14 02:45:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 544. [2024-10-14 02:45:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 420 states have (on average 1.630952380952381) internal successors, (685), 441 states have internal predecessors, (685), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 878 transitions. [2024-10-14 02:45:45,793 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 878 transitions. Word has length 61 [2024-10-14 02:45:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:45,793 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 878 transitions. [2024-10-14 02:45:45,794 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, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 878 transitions. [2024-10-14 02:45:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 02:45:45,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:45,794 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-10-14 02:45:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:45:45,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:45,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1050158881, now seen corresponding path program 1 times [2024-10-14 02:45:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137736708] [2024-10-14 02:45:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:45:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:46,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:46,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137736708] [2024-10-14 02:45:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137736708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:46,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:45:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020783673] [2024-10-14 02:45:46,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:45:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:45:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:45:46,198 INFO L87 Difference]: Start difference. First operand 544 states and 878 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:49,236 INFO L93 Difference]: Finished difference Result 1204 states and 1990 transitions. [2024-10-14 02:45:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:45:49,237 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-10-14 02:45:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:49,240 INFO L225 Difference]: With dead ends: 1204 [2024-10-14 02:45:49,240 INFO L226 Difference]: Without dead ends: 719 [2024-10-14 02:45:49,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-10-14 02:45:49,242 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 685 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:49,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1040 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:45:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-14 02:45:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 549. [2024-10-14 02:45:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 425 states have (on average 1.6235294117647059) internal successors, (690), 446 states have internal predecessors, (690), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 02:45:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 883 transitions. [2024-10-14 02:45:49,304 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 883 transitions. Word has length 62 [2024-10-14 02:45:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:49,304 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 883 transitions. [2024-10-14 02:45:49,304 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 02:45:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 883 transitions. [2024-10-14 02:45:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 02:45:49,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:49,305 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-10-14 02:45:49,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:45:49,305 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 191135427, now seen corresponding path program 1 times [2024-10-14 02:45:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360664142] [2024-10-14 02:45:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:45:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:45:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:45:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:49,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360664142] [2024-10-14 02:45:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360664142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:49,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:45:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:45:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363813265] [2024-10-14 02:45:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:49,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:45:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:45:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:45:49,834 INFO L87 Difference]: Start difference. First operand 549 states and 883 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 02:45:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:55,503 INFO L93 Difference]: Finished difference Result 2011 states and 3401 transitions. [2024-10-14 02:45:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:45:55,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2024-10-14 02:45:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:55,513 INFO L225 Difference]: With dead ends: 2011 [2024-10-14 02:45:55,513 INFO L226 Difference]: Without dead ends: 1533 [2024-10-14 02:45:55,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 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-10-14 02:45:55,515 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 2671 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 3913 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 4570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 3913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:55,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 1605 Invalid, 4570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 3913 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 02:45:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-10-14 02:45:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1052. [2024-10-14 02:45:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 815 states have (on average 1.656441717791411) internal successors, (1350), 845 states have internal predecessors, (1350), 192 states have call successors, (192), 43 states have call predecessors, (192), 44 states have return successors, (194), 176 states have call predecessors, (194), 187 states have call successors, (194) [2024-10-14 02:45:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1736 transitions. [2024-10-14 02:45:55,692 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1736 transitions. Word has length 63 [2024-10-14 02:45:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:55,692 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1736 transitions. [2024-10-14 02:45:55,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-14 02:45:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1736 transitions. [2024-10-14 02:45:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 02:45:55,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:55,695 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:55,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:45:55,695 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:55,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash 37202654, now seen corresponding path program 1 times [2024-10-14 02:45:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792447541] [2024-10-14 02:45:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:45:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:45:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:45:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:45:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:45:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 02:45:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792447541] [2024-10-14 02:45:56,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792447541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:45:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297125349] [2024-10-14 02:45:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:45:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:45:56,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:45:56,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:45:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:56,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:45:56,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:45:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 02:45:57,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:45:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297125349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:57,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:45:57,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2024-10-14 02:45:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964749139] [2024-10-14 02:45:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:57,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:45:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:45:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:45:57,002 INFO L87 Difference]: Start difference. First operand 1052 states and 1736 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:45:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:45:57,497 INFO L93 Difference]: Finished difference Result 2049 states and 3461 transitions. [2024-10-14 02:45:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:45:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 114 [2024-10-14 02:45:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:45:57,503 INFO L225 Difference]: With dead ends: 2049 [2024-10-14 02:45:57,503 INFO L226 Difference]: Without dead ends: 1068 [2024-10-14 02:45:57,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:45:57,507 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 826 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:45:57,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 2139 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 02:45:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2024-10-14 02:45:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2024-10-14 02:45:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 829 states have (on average 1.6574185765983112) internal successors, (1374), 859 states have internal predecessors, (1374), 192 states have call successors, (192), 45 states have call predecessors, (192), 46 states have return successors, (196), 176 states have call predecessors, (196), 187 states have call successors, (196) [2024-10-14 02:45:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1762 transitions. [2024-10-14 02:45:57,665 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1762 transitions. Word has length 114 [2024-10-14 02:45:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:45:57,665 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1762 transitions. [2024-10-14 02:45:57,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:45:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1762 transitions. [2024-10-14 02:45:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 02:45:57,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:45:57,668 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:45:57,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:45:57,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 02:45:57,871 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:45:57,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:45:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1734732660, now seen corresponding path program 1 times [2024-10-14 02:45:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:45:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577905729] [2024-10-14 02:45:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:45:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:45:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:45:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:45:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:45:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:45:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:45:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:45:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:45:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:45:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 02:45:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:45:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577905729] [2024-10-14 02:45:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577905729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:45:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896357907] [2024-10-14 02:45:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:45:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:45:59,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:45:59,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:45:59,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:45:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:45:59,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 1670 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 02:45:59,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:45:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 02:45:59,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:45:59,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896357907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:45:59,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:45:59,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 32 [2024-10-14 02:45:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253687333] [2024-10-14 02:45:59,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:45:59,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:45:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:45:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:45:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2024-10-14 02:45:59,386 INFO L87 Difference]: Start difference. First operand 1068 states and 1762 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 02:46:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:01,550 INFO L93 Difference]: Finished difference Result 2993 states and 5002 transitions. [2024-10-14 02:46:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:46:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2024-10-14 02:46:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:01,560 INFO L225 Difference]: With dead ends: 2993 [2024-10-14 02:46:01,560 INFO L226 Difference]: Without dead ends: 1994 [2024-10-14 02:46:01,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 02:46:01,565 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1618 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 4955 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 5212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 4955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:01,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1926 Invalid, 5212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 4955 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 02:46:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-14 02:46:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1827. [2024-10-14 02:46:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1403 states have (on average 1.6478973627940128) internal successors, (2312), 1443 states have internal predecessors, (2312), 338 states have call successors, (338), 73 states have call predecessors, (338), 85 states have return successors, (374), 321 states have call predecessors, (374), 333 states have call successors, (374) [2024-10-14 02:46:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 3024 transitions. [2024-10-14 02:46:01,878 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 3024 transitions. Word has length 115 [2024-10-14 02:46:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 3024 transitions. [2024-10-14 02:46:01,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-14 02:46:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3024 transitions. [2024-10-14 02:46:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 02:46:01,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:01,882 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:46:01,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:46:02,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:46:02,083 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:02,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 633825202, now seen corresponding path program 1 times [2024-10-14 02:46:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:02,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624526796] [2024-10-14 02:46:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:46:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:46:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:46:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:46:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:46:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:46:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:46:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 02:46:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624526796] [2024-10-14 02:46:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624526796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:02,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:02,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:46:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322702684] [2024-10-14 02:46:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:02,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:46:02,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:46:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:46:02,873 INFO L87 Difference]: Start difference. First operand 1827 states and 3024 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-14 02:46:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:46:07,701 INFO L93 Difference]: Finished difference Result 4168 states and 7219 transitions. [2024-10-14 02:46:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:46:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 116 [2024-10-14 02:46:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:46:07,711 INFO L225 Difference]: With dead ends: 4168 [2024-10-14 02:46:07,711 INFO L226 Difference]: Without dead ends: 2404 [2024-10-14 02:46:07,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:46:07,719 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 2583 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 3914 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 4757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 3914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:46:07,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 1882 Invalid, 4757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 3914 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:46:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-14 02:46:08,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1847. [2024-10-14 02:46:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1419 states have (on average 1.6377730796335448) internal successors, (2324), 1459 states have internal predecessors, (2324), 338 states have call successors, (338), 77 states have call predecessors, (338), 89 states have return successors, (378), 321 states have call predecessors, (378), 333 states have call successors, (378) [2024-10-14 02:46:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 3040 transitions. [2024-10-14 02:46:08,082 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 3040 transitions. Word has length 116 [2024-10-14 02:46:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:46:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 3040 transitions. [2024-10-14 02:46:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-14 02:46:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3040 transitions. [2024-10-14 02:46:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 02:46:08,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:46:08,086 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:46:08,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 02:46:08,086 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:46:08,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:46:08,086 INFO L85 PathProgramCache]: Analyzing trace with hash -940756196, now seen corresponding path program 1 times [2024-10-14 02:46:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:46:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353689657] [2024-10-14 02:46:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:46:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:46:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:46:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:46:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:46:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:46:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:46:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:46:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:46:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:46:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:46:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:46:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:46:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 02:46:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:46:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353689657] [2024-10-14 02:46:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353689657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:46:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:46:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:46:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358147981] [2024-10-14 02:46:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:46:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:46:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:46:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:46:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:46:08,892 INFO L87 Difference]: Start difference. First operand 1847 states and 3040 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16)