./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product11.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 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:33:35,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:33:35,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:33:35,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:33:35,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:33:35,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:33:35,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:33:35,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:33:35,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:33:35,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:33:35,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:33:35,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:33:35,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:33:35,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:33:35,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:33:35,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:33:35,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:33:35,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:33:35,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:33:35,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:33:35,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:33:35,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:33:35,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:33:35,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:33:35,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:33:35,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:33:35,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:33:35,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:33:35,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:33:35,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:33:35,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:33:35,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:33:35,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:33:35,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:33:35,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:33:35,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:33:35,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:33:35,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:33:35,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:33:35,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:33:35,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:33:35,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:33:35,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d [2024-11-11 20:33:36,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:33:36,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:33:36,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:33:36,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:33:36,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:33:36,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2024-11-11 20:33:37,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:33:37,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:33:37,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2024-11-11 20:33:38,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a6536b5/62a7b7d578f94dd09bc8e69f82269d6f/FLAGaa3d5e5e3 [2024-11-11 20:33:38,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a6536b5/62a7b7d578f94dd09bc8e69f82269d6f [2024-11-11 20:33:38,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:33:38,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:33:38,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:33:38,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:33:38,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:33:38,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:38,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61938177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:38, skipping insertion in model container [2024-11-11 20:33:38,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:33:38" (1/1) ... [2024-11-11 20:33:38,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:33:38,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c[71954,71967] [2024-11-11 20:33:38,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:33:38,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:33:38,942 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2024-11-11 20:33:38,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [148] [2024-11-11 20:33:38,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [505] [2024-11-11 20:33:38,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [871] [2024-11-11 20:33:38,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1034] [2024-11-11 20:33:38,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1069] [2024-11-11 20:33:38,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1189] [2024-11-11 20:33:38,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1201] [2024-11-11 20:33:38,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2729] [2024-11-11 20:33:38,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3390] [2024-11-11 20:33:39,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c[71954,71967] [2024-11-11 20:33:39,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:33:39,082 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:33:39,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39 WrapperNode [2024-11-11 20:33:39,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:33:39,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:33:39,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:33:39,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:33:39,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,175 INFO L138 Inliner]: procedures = 93, calls = 335, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1087 [2024-11-11 20:33:39,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:33:39,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:33:39,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:33:39,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:33:39,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,225 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-11 20:33:39,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:33:39,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:33:39,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:33:39,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:33:39,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (1/1) ... [2024-11-11 20:33:39,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:33:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:33:39,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:33:39,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:33:39,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:33:39,399 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:33:39,400 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:33:39,400 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:33:39,400 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:33:39,400 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-11 20:33:39,400 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-11 20:33:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:33:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:33:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:33:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:33:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:33:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:33:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:33:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:33:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:33:39,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:33:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:33:39,404 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:33:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:33:39,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:33:39,404 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:33:39,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:33:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:33:39,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:33:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:33:39,405 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:33:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-11-11 20:33:39,405 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-11-11 20:33:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:33:39,405 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:33:39,405 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:33:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:33:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:33:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:33:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:33:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:33:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-11 20:33:39,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-11 20:33:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:33:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:33:39,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:33:39,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:33:39,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:33:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:33:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:33:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:33:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:33:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:33:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:33:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:33:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:33:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:33:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:33:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:33:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:33:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:33:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:33:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:33:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:33:39,413 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:33:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:33:39,413 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:33:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:33:39,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:33:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:33:39,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:33:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:33:39,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:33:39,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:33:39,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:33:40,853 INFO L? ?]: Removed 437 outVars from TransFormulas that were not future-live. [2024-11-11 20:33:40,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:33:40,885 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:33:40,885 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:33:40,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:33:40 BoogieIcfgContainer [2024-11-11 20:33:40,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:33:40,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:33:40,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:33:40,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:33:40,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:33:38" (1/3) ... [2024-11-11 20:33:40,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afbb580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:33:40, skipping insertion in model container [2024-11-11 20:33:40,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:39" (2/3) ... [2024-11-11 20:33:40,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afbb580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:33:40, skipping insertion in model container [2024-11-11 20:33:40,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:33:40" (3/3) ... [2024-11-11 20:33:40,894 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2024-11-11 20:33:40,910 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:33:40,911 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:33:40,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:33:41,004 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;@2912560f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:33:41,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:33:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 429 states have (on average 1.6993006993006994) internal successors, (729), 450 states have internal predecessors, (729), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-11 20:33:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 20:33:41,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:41,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:41,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:41,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1289670013, now seen corresponding path program 1 times [2024-11-11 20:33:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148826871] [2024-11-11 20:33:41,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:33:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:33:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:33:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:33:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:33:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:33:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148826871] [2024-11-11 20:33:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148826871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:33:42,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818178696] [2024-11-11 20:33:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:42,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:33:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:33:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:33:42,573 INFO L87 Difference]: Start difference. First operand has 545 states, 429 states have (on average 1.6993006993006994) internal successors, (729), 450 states have internal predecessors, (729), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:33:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:48,378 INFO L93 Difference]: Finished difference Result 1313 states and 2243 transitions. [2024-11-11 20:33:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:33:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-11 20:33:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:48,409 INFO L225 Difference]: With dead ends: 1313 [2024-11-11 20:33:48,411 INFO L226 Difference]: Without dead ends: 780 [2024-11-11 20:33:48,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:48,429 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 949 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:48,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1746 Invalid, 3150 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [198 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 20:33:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-11 20:33:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 537. [2024-11-11 20:33:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 423 states have (on average 1.6950354609929077) internal successors, (717), 442 states have internal predecessors, (717), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-11 20:33:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 894 transitions. [2024-11-11 20:33:48,685 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 894 transitions. Word has length 104 [2024-11-11 20:33:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 894 transitions. [2024-11-11 20:33:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:33:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 894 transitions. [2024-11-11 20:33:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 20:33:48,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:48,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:33:48,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 851010391, now seen corresponding path program 1 times [2024-11-11 20:33:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769144548] [2024-11-11 20:33:48,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:33:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:33:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:33:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:33:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:33:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:33:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769144548] [2024-11-11 20:33:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769144548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:49,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:33:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853578143] [2024-11-11 20:33:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:49,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:33:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:33:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:33:49,443 INFO L87 Difference]: Start difference. First operand 537 states and 894 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:33:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:54,061 INFO L93 Difference]: Finished difference Result 1299 states and 2205 transitions. [2024-11-11 20:33:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:33:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-11-11 20:33:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:54,071 INFO L225 Difference]: With dead ends: 1299 [2024-11-11 20:33:54,072 INFO L226 Difference]: Without dead ends: 780 [2024-11-11 20:33:54,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:54,078 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 1826 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 3204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:54,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 1593 Invalid, 3204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-11 20:33:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-11 20:33:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 537. [2024-11-11 20:33:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 423 states have (on average 1.6926713947990544) internal successors, (716), 442 states have internal predecessors, (716), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-11 20:33:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 893 transitions. [2024-11-11 20:33:54,190 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 893 transitions. Word has length 107 [2024-11-11 20:33:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:54,191 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 893 transitions. [2024-11-11 20:33:54,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:33:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 893 transitions. [2024-11-11 20:33:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:33:54,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:54,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:54,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:33:54,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:54,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1290038099, now seen corresponding path program 1 times [2024-11-11 20:33:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205091008] [2024-11-11 20:33:54,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:33:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:33:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:33:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:33:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:33:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:33:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:33:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205091008] [2024-11-11 20:33:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205091008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:54,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:33:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226896148] [2024-11-11 20:33:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:54,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:33:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:33:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:33:54,829 INFO L87 Difference]: Start difference. First operand 537 states and 893 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:33:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:58,974 INFO L93 Difference]: Finished difference Result 1299 states and 2204 transitions. [2024-11-11 20:33:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:33:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2024-11-11 20:33:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:58,980 INFO L225 Difference]: With dead ends: 1299 [2024-11-11 20:33:58,980 INFO L226 Difference]: Without dead ends: 780 [2024-11-11 20:33:58,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:58,984 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1816 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 1604 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 20:33:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-11 20:33:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 537. [2024-11-11 20:33:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 423 states have (on average 1.690307328605201) internal successors, (715), 442 states have internal predecessors, (715), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-11 20:33:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 892 transitions. [2024-11-11 20:33:59,080 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 892 transitions. Word has length 108 [2024-11-11 20:33:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:59,081 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 892 transitions. [2024-11-11 20:33:59,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:33:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 892 transitions. [2024-11-11 20:33:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:33:59,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:59,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:33:59,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1222954669, now seen corresponding path program 1 times [2024-11-11 20:33:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314642337] [2024-11-11 20:33:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:33:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:33:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:33:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:33:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:33:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:33:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:33:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314642337] [2024-11-11 20:33:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314642337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:59,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:59,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:33:59,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775693433] [2024-11-11 20:33:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:59,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:33:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:33:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:33:59,845 INFO L87 Difference]: Start difference. First operand 537 states and 892 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:04,035 INFO L93 Difference]: Finished difference Result 1299 states and 2203 transitions. [2024-11-11 20:34:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:04,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-11 20:34:04,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:04,042 INFO L225 Difference]: With dead ends: 1299 [2024-11-11 20:34:04,042 INFO L226 Difference]: Without dead ends: 780 [2024-11-11 20:34:04,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:04,046 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 1386 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:04,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 1641 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-11 20:34:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-11 20:34:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 537. [2024-11-11 20:34:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 423 states have (on average 1.6879432624113475) internal successors, (714), 442 states have internal predecessors, (714), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-11 20:34:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 891 transitions. [2024-11-11 20:34:04,155 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 891 transitions. Word has length 109 [2024-11-11 20:34:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:04,155 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 891 transitions. [2024-11-11 20:34:04,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 891 transitions. [2024-11-11 20:34:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:34:04,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:04,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:04,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:34:04,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:04,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash -759301681, now seen corresponding path program 1 times [2024-11-11 20:34:04,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:04,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709330536] [2024-11-11 20:34:04,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:34:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:34:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:04,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709330536] [2024-11-11 20:34:04,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709330536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:04,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:04,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396783391] [2024-11-11 20:34:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:04,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:04,830 INFO L87 Difference]: Start difference. First operand 537 states and 891 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:08,959 INFO L93 Difference]: Finished difference Result 1299 states and 2202 transitions. [2024-11-11 20:34:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:34:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-11 20:34:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:08,966 INFO L225 Difference]: With dead ends: 1299 [2024-11-11 20:34:08,966 INFO L226 Difference]: Without dead ends: 780 [2024-11-11 20:34:08,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:08,970 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 1377 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:08,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1663 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 20:34:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-11 20:34:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 537. [2024-11-11 20:34:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 423 states have (on average 1.6855791962174942) internal successors, (713), 442 states have internal predecessors, (713), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-11 20:34:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 890 transitions. [2024-11-11 20:34:09,065 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 890 transitions. Word has length 110 [2024-11-11 20:34:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 890 transitions. [2024-11-11 20:34:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 890 transitions. [2024-11-11 20:34:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:34:09,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:09,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:09,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:34:09,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:09,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1786056527, now seen corresponding path program 1 times [2024-11-11 20:34:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582967494] [2024-11-11 20:34:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:34:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:09,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582967494] [2024-11-11 20:34:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582967494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:09,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:09,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:34:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973481962] [2024-11-11 20:34:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:09,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:34:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:34:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:34:09,802 INFO L87 Difference]: Start difference. First operand 537 states and 890 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:16,250 INFO L93 Difference]: Finished difference Result 1276 states and 2152 transitions. [2024-11-11 20:34:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 20:34:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-11-11 20:34:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:16,258 INFO L225 Difference]: With dead ends: 1276 [2024-11-11 20:34:16,258 INFO L226 Difference]: Without dead ends: 806 [2024-11-11 20:34:16,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:34:16,262 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 1486 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 6784 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 3761 SdHoareTripleChecker+Invalid, 7129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 6784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:16,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 3761 Invalid, 7129 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [345 Valid, 6784 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 20:34:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-11 20:34:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 550. [2024-11-11 20:34:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 433 states have (on average 1.6812933025404158) internal successors, (728), 454 states have internal predecessors, (728), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 909 transitions. [2024-11-11 20:34:16,381 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 909 transitions. Word has length 111 [2024-11-11 20:34:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:16,381 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 909 transitions. [2024-11-11 20:34:16,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 909 transitions. [2024-11-11 20:34:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:34:16,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:16,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:16,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:34:16,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:16,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash 976569070, now seen corresponding path program 1 times [2024-11-11 20:34:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656015009] [2024-11-11 20:34:16,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:34:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656015009] [2024-11-11 20:34:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656015009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:16,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:16,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596206641] [2024-11-11 20:34:16,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:16,974 INFO L87 Difference]: Start difference. First operand 550 states and 909 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:21,342 INFO L93 Difference]: Finished difference Result 1302 states and 2194 transitions. [2024-11-11 20:34:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-11 20:34:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:21,349 INFO L225 Difference]: With dead ends: 1302 [2024-11-11 20:34:21,349 INFO L226 Difference]: Without dead ends: 814 [2024-11-11 20:34:21,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:21,353 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1015 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:21,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1725 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2937 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-11 20:34:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-11 20:34:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 550. [2024-11-11 20:34:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 433 states have (on average 1.6697459584295613) internal successors, (723), 454 states have internal predecessors, (723), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 904 transitions. [2024-11-11 20:34:21,510 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 904 transitions. Word has length 111 [2024-11-11 20:34:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:21,511 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 904 transitions. [2024-11-11 20:34:21,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 904 transitions. [2024-11-11 20:34:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:34:21,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:21,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:21,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:34:21,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:21,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -966006702, now seen corresponding path program 1 times [2024-11-11 20:34:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807023930] [2024-11-11 20:34:21,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:34:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807023930] [2024-11-11 20:34:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807023930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307949245] [2024-11-11 20:34:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:22,106 INFO L87 Difference]: Start difference. First operand 550 states and 904 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:26,223 INFO L93 Difference]: Finished difference Result 1302 states and 2189 transitions. [2024-11-11 20:34:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2024-11-11 20:34:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:26,228 INFO L225 Difference]: With dead ends: 1302 [2024-11-11 20:34:26,228 INFO L226 Difference]: Without dead ends: 814 [2024-11-11 20:34:26,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:26,231 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1009 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:26,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1724 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-11 20:34:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-11 20:34:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 550. [2024-11-11 20:34:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 433 states have (on average 1.6581986143187066) internal successors, (718), 454 states have internal predecessors, (718), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 899 transitions. [2024-11-11 20:34:26,351 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 899 transitions. Word has length 112 [2024-11-11 20:34:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:26,352 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 899 transitions. [2024-11-11 20:34:26,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 899 transitions. [2024-11-11 20:34:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:34:26,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:26,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:26,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:34:26,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:26,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -374520397, now seen corresponding path program 1 times [2024-11-11 20:34:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:26,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22233395] [2024-11-11 20:34:26,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:34:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22233395] [2024-11-11 20:34:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22233395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:26,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:26,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449047995] [2024-11-11 20:34:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:26,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:26,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:26,947 INFO L87 Difference]: Start difference. First operand 550 states and 899 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:30,547 INFO L93 Difference]: Finished difference Result 1302 states and 2184 transitions. [2024-11-11 20:34:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-11 20:34:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:30,553 INFO L225 Difference]: With dead ends: 1302 [2024-11-11 20:34:30,553 INFO L226 Difference]: Without dead ends: 814 [2024-11-11 20:34:30,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:30,556 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1446 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:30,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1654 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:34:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-11 20:34:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 550. [2024-11-11 20:34:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 433 states have (on average 1.6466512702078522) internal successors, (713), 454 states have internal predecessors, (713), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 894 transitions. [2024-11-11 20:34:30,664 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 894 transitions. Word has length 113 [2024-11-11 20:34:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 894 transitions. [2024-11-11 20:34:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 894 transitions. [2024-11-11 20:34:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:34:30,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:30,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:30,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:34:30,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:30,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash 936457175, now seen corresponding path program 1 times [2024-11-11 20:34:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:30,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505443995] [2024-11-11 20:34:30,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:31,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505443995] [2024-11-11 20:34:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505443995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:34:31,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959095951] [2024-11-11 20:34:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:34:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:34:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:31,244 INFO L87 Difference]: Start difference. First operand 550 states and 894 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:36,407 INFO L93 Difference]: Finished difference Result 1279 states and 2139 transitions. [2024-11-11 20:34:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:34:36,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-11 20:34:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:36,412 INFO L225 Difference]: With dead ends: 1279 [2024-11-11 20:34:36,412 INFO L226 Difference]: Without dead ends: 806 [2024-11-11 20:34:36,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:34:36,414 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 1836 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 4960 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 5437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 4960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:36,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1909 Valid, 2912 Invalid, 5437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 4960 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 20:34:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-11 20:34:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 550. [2024-11-11 20:34:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 433 states have (on average 1.6443418013856812) internal successors, (712), 454 states have internal predecessors, (712), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 893 transitions. [2024-11-11 20:34:36,531 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 893 transitions. Word has length 114 [2024-11-11 20:34:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:36,531 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 893 transitions. [2024-11-11 20:34:36,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 893 transitions. [2024-11-11 20:34:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:34:36,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:36,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:36,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:34:36,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:36,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1463478967, now seen corresponding path program 1 times [2024-11-11 20:34:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:36,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537207908] [2024-11-11 20:34:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:34:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537207908] [2024-11-11 20:34:37,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537207908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:37,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:37,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40322015] [2024-11-11 20:34:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:37,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:37,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:37,067 INFO L87 Difference]: Start difference. First operand 550 states and 893 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:40,667 INFO L93 Difference]: Finished difference Result 1302 states and 2175 transitions. [2024-11-11 20:34:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-11-11 20:34:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:40,673 INFO L225 Difference]: With dead ends: 1302 [2024-11-11 20:34:40,673 INFO L226 Difference]: Without dead ends: 814 [2024-11-11 20:34:40,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:40,676 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1443 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:40,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1654 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:34:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-11 20:34:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 550. [2024-11-11 20:34:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 433 states have (on average 1.6327944572748267) internal successors, (707), 454 states have internal predecessors, (707), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 888 transitions. [2024-11-11 20:34:40,806 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 888 transitions. Word has length 114 [2024-11-11 20:34:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:40,806 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 888 transitions. [2024-11-11 20:34:40,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 888 transitions. [2024-11-11 20:34:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:34:40,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:40,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:34:40,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2140462550, now seen corresponding path program 1 times [2024-11-11 20:34:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776741476] [2024-11-11 20:34:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776741476] [2024-11-11 20:34:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776741476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:34:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167485257] [2024-11-11 20:34:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:34:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:34:41,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:41,436 INFO L87 Difference]: Start difference. First operand 550 states and 888 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:47,235 INFO L93 Difference]: Finished difference Result 1288 states and 2143 transitions. [2024-11-11 20:34:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:34:47,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-11 20:34:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:47,240 INFO L225 Difference]: With dead ends: 1288 [2024-11-11 20:34:47,240 INFO L226 Difference]: Without dead ends: 812 [2024-11-11 20:34:47,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:34:47,242 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 972 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 5099 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 5296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 5099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:47,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 3045 Invalid, 5296 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [197 Valid, 5099 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-11 20:34:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-11 20:34:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 553. [2024-11-11 20:34:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 436 states have (on average 1.6261467889908257) internal successors, (709), 457 states have internal predecessors, (709), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 890 transitions. [2024-11-11 20:34:47,384 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 890 transitions. Word has length 115 [2024-11-11 20:34:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 890 transitions. [2024-11-11 20:34:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 890 transitions. [2024-11-11 20:34:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:34:47,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:47,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:34:47,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1006289800, now seen corresponding path program 1 times [2024-11-11 20:34:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650162441] [2024-11-11 20:34:47,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:34:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:47,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650162441] [2024-11-11 20:34:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650162441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:47,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145438148] [2024-11-11 20:34:47,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:47,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:47,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:47,893 INFO L87 Difference]: Start difference. First operand 553 states and 890 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:51,946 INFO L93 Difference]: Finished difference Result 1311 states and 2175 transitions. [2024-11-11 20:34:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:34:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-11-11 20:34:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:51,950 INFO L225 Difference]: With dead ends: 1311 [2024-11-11 20:34:51,950 INFO L226 Difference]: Without dead ends: 820 [2024-11-11 20:34:51,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:34:51,952 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 993 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 2815 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:51,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 1722 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2815 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-11 20:34:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-11 20:34:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 553. [2024-11-11 20:34:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 436 states have (on average 1.614678899082569) internal successors, (704), 457 states have internal predecessors, (704), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 885 transitions. [2024-11-11 20:34:52,056 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 885 transitions. Word has length 115 [2024-11-11 20:34:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:52,057 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 885 transitions. [2024-11-11 20:34:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 885 transitions. [2024-11-11 20:34:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:34:52,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:52,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:34:52,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash -941320388, now seen corresponding path program 1 times [2024-11-11 20:34:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516928800] [2024-11-11 20:34:52,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:34:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516928800] [2024-11-11 20:34:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516928800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988533337] [2024-11-11 20:34:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:52,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:52,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:52,665 INFO L87 Difference]: Start difference. First operand 553 states and 885 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:56,943 INFO L93 Difference]: Finished difference Result 1292 states and 2140 transitions. [2024-11-11 20:34:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:34:56,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-11-11 20:34:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:56,948 INFO L225 Difference]: With dead ends: 1292 [2024-11-11 20:34:56,948 INFO L226 Difference]: Without dead ends: 816 [2024-11-11 20:34:56,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:34:56,950 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 958 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:56,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1711 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-11 20:34:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-11 20:34:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 557. [2024-11-11 20:34:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 440 states have (on average 1.606818181818182) internal successors, (707), 461 states have internal predecessors, (707), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2024-11-11 20:34:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 888 transitions. [2024-11-11 20:34:57,083 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 888 transitions. Word has length 116 [2024-11-11 20:34:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:57,084 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 888 transitions. [2024-11-11 20:34:57,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:34:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 888 transitions. [2024-11-11 20:34:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:34:57,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:57,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:57,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:34:57,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:57,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash 422082844, now seen corresponding path program 1 times [2024-11-11 20:34:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500814452] [2024-11-11 20:34:57,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:34:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:34:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:34:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:34:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:34:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:34:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:34:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:34:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500814452] [2024-11-11 20:34:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500814452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:57,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:34:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675597431] [2024-11-11 20:34:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:34:57,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:34:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:34:57,620 INFO L87 Difference]: Start difference. First operand 557 states and 888 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)