./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product32.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_spec2_product32.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 256d604ca5845ed70fae4c0c59880096896900821991ad09252cbc35739a584c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:31:00,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:31:00,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:31:00,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:31:00,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:31:00,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:31:00,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:31:00,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:31:00,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:31:00,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:31:00,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:31:00,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:31:00,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:31:00,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:31:00,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:31:00,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:31:00,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:31:00,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:31:00,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:31:00,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:31:00,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:31:00,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:31:00,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:31:00,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:31:00,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:31:00,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:31:00,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:31:00,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:31:00,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:31:00,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:31:00,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:31:00,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:31:00,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:31:00,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:31:00,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:31:00,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:31:00,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:31:00,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:31:00,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:31:00,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:31:00,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:31:00,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:31:00,347 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 -> 256d604ca5845ed70fae4c0c59880096896900821991ad09252cbc35739a584c [2024-11-11 20:31:00,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:31:00,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:31:00,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:31:00,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:31:00,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:31:00,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2024-11-11 20:31:01,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:31:02,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:31:02,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2024-11-11 20:31:02,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d7897e2/7b3fc875e7d943caa8c34f24020ebf96/FLAGbdaab2970 [2024-11-11 20:31:02,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d7897e2/7b3fc875e7d943caa8c34f24020ebf96 [2024-11-11 20:31:02,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:31:02,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:31:02,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:31:02,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:31:02,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:31:02,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:02,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca15420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02, skipping insertion in model container [2024-11-11 20:31:02,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:02,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:31:02,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c[40079,40092] [2024-11-11 20:31:02,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:31:02,829 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:31:02,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2024-11-11 20:31:02,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [236] [2024-11-11 20:31:02,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [904] [2024-11-11 20:31:02,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1270] [2024-11-11 20:31:02,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1308] [2024-11-11 20:31:02,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1406] [2024-11-11 20:31:02,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1420] [2024-11-11 20:31:02,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1540] [2024-11-11 20:31:02,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1891] [2024-11-11 20:31:02,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1900] [2024-11-11 20:31:02,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c[40079,40092] [2024-11-11 20:31:02,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:31:02,956 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:31:02,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02 WrapperNode [2024-11-11 20:31:02,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:31:02,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:31:02,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:31:02,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:31:02,962 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:31:02" (1/1) ... [2024-11-11 20:31:02,990 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:31:02" (1/1) ... [2024-11-11 20:31:03,026 INFO L138 Inliner]: procedures = 99, calls = 355, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 980 [2024-11-11 20:31:03,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:31:03,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:31:03,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:31:03,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:31:03,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,075 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:31:03,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:31:03,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:31:03,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:31:03,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:31:03,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (1/1) ... [2024-11-11 20:31:03,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:31:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:31:03,178 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:31:03,180 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:31:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:31:03,216 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:31:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:31:03,216 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:31:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:31:03,217 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:31:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-11 20:31:03,217 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-11 20:31:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:31:03,217 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:31:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:31:03,218 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:31:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:31:03,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:31:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:31:03,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:31:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-11 20:31:03,219 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-11 20:31:03,219 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:31:03,220 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:31:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:31:03,220 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:31:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:31:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-11 20:31:03,220 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-11 20:31:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:31:03,220 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:31:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-11 20:31:03,220 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:31:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:31:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:31:03,222 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:31:03,222 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:31:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:31:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:31:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:31:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:31:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:31:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:31:03,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:31:03,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:31:03,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:31:03,225 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:31:03,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:31:03,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:31:03,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:31:03,225 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:31:03,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:31:03,225 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-11-11 20:31:03,225 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-11-11 20:31:03,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:31:03,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:31:04,233 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2024-11-11 20:31:04,233 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:31:04,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:31:04,263 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:31:04,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:31:04 BoogieIcfgContainer [2024-11-11 20:31:04,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:31:04,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:31:04,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:31:04,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:31:04,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:31:02" (1/3) ... [2024-11-11 20:31:04,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38502b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:31:04, skipping insertion in model container [2024-11-11 20:31:04,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:31:02" (2/3) ... [2024-11-11 20:31:04,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38502b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:31:04, skipping insertion in model container [2024-11-11 20:31:04,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:31:04" (3/3) ... [2024-11-11 20:31:04,298 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2024-11-11 20:31:04,321 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:31:04,321 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:31:04,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:31:04,420 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;@111b110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:31:04,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:31:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 605 states, 471 states have (on average 1.6772823779193207) internal successors, (790), 494 states have internal predecessors, (790), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-11 20:31:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 20:31:04,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:04,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:04,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:04,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash -755175593, now seen corresponding path program 1 times [2024-11-11 20:31:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:04,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031371999] [2024-11-11 20:31:04,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:31:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:31:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031371999] [2024-11-11 20:31:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031371999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724832747] [2024-11-11 20:31:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:05,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:05,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:05,371 INFO L87 Difference]: Start difference. First operand has 605 states, 471 states have (on average 1.6772823779193207) internal successors, (790), 494 states have internal predecessors, (790), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:09,563 INFO L93 Difference]: Finished difference Result 1353 states and 2269 transitions. [2024-11-11 20:31:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:31:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-11-11 20:31:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:09,584 INFO L225 Difference]: With dead ends: 1353 [2024-11-11 20:31:09,584 INFO L226 Difference]: Without dead ends: 760 [2024-11-11 20:31:09,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:09,594 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 736 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:09,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1184 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-11 20:31:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-11 20:31:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 597. [2024-11-11 20:31:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.6731182795698925) internal successors, (778), 486 states have internal predecessors, (778), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 983 transitions. [2024-11-11 20:31:09,734 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 983 transitions. Word has length 60 [2024-11-11 20:31:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:09,735 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 983 transitions. [2024-11-11 20:31:09,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 983 transitions. [2024-11-11 20:31:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 20:31:09,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:09,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:09,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:31:09,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:09,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash 102509911, now seen corresponding path program 1 times [2024-11-11 20:31:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:09,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815907060] [2024-11-11 20:31:09,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 20:31:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:10,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815907060] [2024-11-11 20:31:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815907060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593197079] [2024-11-11 20:31:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:10,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:10,252 INFO L87 Difference]: Start difference. First operand 597 states and 983 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:14,003 INFO L93 Difference]: Finished difference Result 1339 states and 2235 transitions. [2024-11-11 20:31:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:31:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-11-11 20:31:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:14,008 INFO L225 Difference]: With dead ends: 1339 [2024-11-11 20:31:14,008 INFO L226 Difference]: Without dead ends: 760 [2024-11-11 20:31:14,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:14,011 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 734 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:14,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1171 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:31:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-11 20:31:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 597. [2024-11-11 20:31:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.6709677419354838) internal successors, (777), 486 states have internal predecessors, (777), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 982 transitions. [2024-11-11 20:31:14,084 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 982 transitions. Word has length 63 [2024-11-11 20:31:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:14,085 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 982 transitions. [2024-11-11 20:31:14,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 982 transitions. [2024-11-11 20:31:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 20:31:14,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:14,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:14,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:31:14,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:14,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1243916775, now seen corresponding path program 1 times [2024-11-11 20:31:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646386883] [2024-11-11 20:31:14,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:31:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646386883] [2024-11-11 20:31:14,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646386883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:14,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:14,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33076975] [2024-11-11 20:31:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:14,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:14,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:14,564 INFO L87 Difference]: Start difference. First operand 597 states and 982 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:17,973 INFO L93 Difference]: Finished difference Result 1339 states and 2234 transitions. [2024-11-11 20:31:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:31:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2024-11-11 20:31:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:17,978 INFO L225 Difference]: With dead ends: 1339 [2024-11-11 20:31:17,978 INFO L226 Difference]: Without dead ends: 760 [2024-11-11 20:31:17,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:17,980 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 732 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:17,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1156 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 20:31:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-11 20:31:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 597. [2024-11-11 20:31:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.6688172043010752) internal successors, (776), 486 states have internal predecessors, (776), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 981 transitions. [2024-11-11 20:31:18,050 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 981 transitions. Word has length 64 [2024-11-11 20:31:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:18,050 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 981 transitions. [2024-11-11 20:31:18,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 981 transitions. [2024-11-11 20:31:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 20:31:18,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:18,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:18,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:31:18,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:18,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1305630675, now seen corresponding path program 1 times [2024-11-11 20:31:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382667789] [2024-11-11 20:31:18,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:31:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:31:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382667789] [2024-11-11 20:31:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382667789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142364416] [2024-11-11 20:31:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:18,490 INFO L87 Difference]: Start difference. First operand 597 states and 981 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:21,929 INFO L93 Difference]: Finished difference Result 1339 states and 2233 transitions. [2024-11-11 20:31:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:31:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-11 20:31:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:21,933 INFO L225 Difference]: With dead ends: 1339 [2024-11-11 20:31:21,933 INFO L226 Difference]: Without dead ends: 760 [2024-11-11 20:31:21,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:21,936 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 730 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 3030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:21,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1156 Invalid, 3030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 20:31:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-11 20:31:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 597. [2024-11-11 20:31:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.6666666666666667) internal successors, (775), 486 states have internal predecessors, (775), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 980 transitions. [2024-11-11 20:31:21,996 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 980 transitions. Word has length 65 [2024-11-11 20:31:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:21,997 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 980 transitions. [2024-11-11 20:31:21,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 980 transitions. [2024-11-11 20:31:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 20:31:21,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:21,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:31:21,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:21,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2038366237, now seen corresponding path program 1 times [2024-11-11 20:31:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:22,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053084139] [2024-11-11 20:31:22,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:31:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:31:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:22,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:22,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053084139] [2024-11-11 20:31:22,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053084139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:22,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:22,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:22,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495301837] [2024-11-11 20:31:22,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:22,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:22,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:22,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:22,440 INFO L87 Difference]: Start difference. First operand 597 states and 980 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:25,662 INFO L93 Difference]: Finished difference Result 1339 states and 2232 transitions. [2024-11-11 20:31:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:31:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 20:31:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:25,666 INFO L225 Difference]: With dead ends: 1339 [2024-11-11 20:31:25,667 INFO L226 Difference]: Without dead ends: 760 [2024-11-11 20:31:25,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:25,670 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1199 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:25,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1157 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 2748 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:31:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-11 20:31:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 597. [2024-11-11 20:31:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.664516129032258) internal successors, (774), 486 states have internal predecessors, (774), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 979 transitions. [2024-11-11 20:31:25,742 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 979 transitions. Word has length 66 [2024-11-11 20:31:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:25,743 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 979 transitions. [2024-11-11 20:31:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 979 transitions. [2024-11-11 20:31:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 20:31:25,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:25,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:25,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:31:25,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 469211246, now seen corresponding path program 1 times [2024-11-11 20:31:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474241967] [2024-11-11 20:31:25,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:31:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:26,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474241967] [2024-11-11 20:31:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474241967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251311094] [2024-11-11 20:31:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:26,152 INFO L87 Difference]: Start difference. First operand 597 states and 979 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:29,129 INFO L93 Difference]: Finished difference Result 1311 states and 2173 transitions. [2024-11-11 20:31:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:31:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-11 20:31:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:29,137 INFO L225 Difference]: With dead ends: 1311 [2024-11-11 20:31:29,137 INFO L226 Difference]: Without dead ends: 772 [2024-11-11 20:31:29,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:31:29,141 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1266 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:29,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 1163 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 20:31:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-11 20:31:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 597. [2024-11-11 20:31:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.653763440860215) internal successors, (769), 486 states have internal predecessors, (769), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 974 transitions. [2024-11-11 20:31:29,217 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 974 transitions. Word has length 67 [2024-11-11 20:31:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:29,217 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 974 transitions. [2024-11-11 20:31:29,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 974 transitions. [2024-11-11 20:31:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 20:31:29,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:29,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:29,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:31:29,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -869304415, now seen corresponding path program 1 times [2024-11-11 20:31:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233353800] [2024-11-11 20:31:29,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:31:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233353800] [2024-11-11 20:31:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233353800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652660029] [2024-11-11 20:31:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:29,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:29,614 INFO L87 Difference]: Start difference. First operand 597 states and 974 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:32,693 INFO L93 Difference]: Finished difference Result 1311 states and 2168 transitions. [2024-11-11 20:31:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:31:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-11 20:31:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:32,697 INFO L225 Difference]: With dead ends: 1311 [2024-11-11 20:31:32,697 INFO L226 Difference]: Without dead ends: 772 [2024-11-11 20:31:32,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:31:32,699 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 788 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:32,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1162 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:31:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-11 20:31:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 597. [2024-11-11 20:31:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.643010752688172) internal successors, (764), 486 states have internal predecessors, (764), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 969 transitions. [2024-11-11 20:31:32,780 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 969 transitions. Word has length 68 [2024-11-11 20:31:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:32,781 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 969 transitions. [2024-11-11 20:31:32,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 969 transitions. [2024-11-11 20:31:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 20:31:32,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:32,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:32,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:31:32,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:32,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1657100141, now seen corresponding path program 1 times [2024-11-11 20:31:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:32,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171056238] [2024-11-11 20:31:32,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:31:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171056238] [2024-11-11 20:31:33,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171056238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:33,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50028210] [2024-11-11 20:31:33,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:33,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:33,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:33,164 INFO L87 Difference]: Start difference. First operand 597 states and 969 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:36,340 INFO L93 Difference]: Finished difference Result 1311 states and 2163 transitions. [2024-11-11 20:31:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:31:36,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2024-11-11 20:31:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:36,344 INFO L225 Difference]: With dead ends: 1311 [2024-11-11 20:31:36,344 INFO L226 Difference]: Without dead ends: 772 [2024-11-11 20:31:36,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:31:36,347 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 786 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:36,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1148 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 20:31:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-11 20:31:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 597. [2024-11-11 20:31:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 465 states have (on average 1.632258064516129) internal successors, (759), 486 states have internal predecessors, (759), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 964 transitions. [2024-11-11 20:31:36,408 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 964 transitions. Word has length 69 [2024-11-11 20:31:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:36,408 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 964 transitions. [2024-11-11 20:31:36,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 964 transitions. [2024-11-11 20:31:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 20:31:36,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:36,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:36,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:31:36,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:36,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1608062393, now seen corresponding path program 1 times [2024-11-11 20:31:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031385802] [2024-11-11 20:31:36,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:36,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:31:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031385802] [2024-11-11 20:31:36,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031385802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:36,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319221994] [2024-11-11 20:31:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:36,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:36,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:36,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:36,797 INFO L87 Difference]: Start difference. First operand 597 states and 964 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:40,056 INFO L93 Difference]: Finished difference Result 1297 states and 2136 transitions. [2024-11-11 20:31:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:31:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-11 20:31:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:40,062 INFO L225 Difference]: With dead ends: 1297 [2024-11-11 20:31:40,063 INFO L226 Difference]: Without dead ends: 764 [2024-11-11 20:31:40,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:40,065 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 773 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:40,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1099 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:31:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-11 20:31:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 599. [2024-11-11 20:31:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 467 states have (on average 1.6295503211991436) internal successors, (761), 488 states have internal predecessors, (761), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 966 transitions. [2024-11-11 20:31:40,128 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 966 transitions. Word has length 70 [2024-11-11 20:31:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:40,129 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 966 transitions. [2024-11-11 20:31:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 966 transitions. [2024-11-11 20:31:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 20:31:40,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:40,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:40,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:31:40,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:40,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1742520230, now seen corresponding path program 1 times [2024-11-11 20:31:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925228233] [2024-11-11 20:31:40,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:31:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:40,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925228233] [2024-11-11 20:31:40,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925228233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:40,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:40,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744749781] [2024-11-11 20:31:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:40,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:40,482 INFO L87 Difference]: Start difference. First operand 599 states and 966 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:43,516 INFO L93 Difference]: Finished difference Result 1317 states and 2163 transitions. [2024-11-11 20:31:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:31:43,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-11 20:31:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:43,520 INFO L225 Difference]: With dead ends: 1317 [2024-11-11 20:31:43,520 INFO L226 Difference]: Without dead ends: 776 [2024-11-11 20:31:43,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:31:43,522 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 784 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:43,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1134 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:31:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-11 20:31:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 599. [2024-11-11 20:31:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 467 states have (on average 1.6188436830835118) internal successors, (756), 488 states have internal predecessors, (756), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 961 transitions. [2024-11-11 20:31:43,583 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 961 transitions. Word has length 70 [2024-11-11 20:31:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 961 transitions. [2024-11-11 20:31:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 961 transitions. [2024-11-11 20:31:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 20:31:43,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:43,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:43,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:31:43,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:43,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1323395509, now seen corresponding path program 1 times [2024-11-11 20:31:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:43,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709327679] [2024-11-11 20:31:43,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:31:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709327679] [2024-11-11 20:31:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709327679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:44,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:31:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252333831] [2024-11-11 20:31:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:44,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:31:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:31:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:31:44,053 INFO L87 Difference]: Start difference. First operand 599 states and 961 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:31:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:48,153 INFO L93 Difference]: Finished difference Result 1311 states and 2148 transitions. [2024-11-11 20:31:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:31:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 71 [2024-11-11 20:31:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:48,157 INFO L225 Difference]: With dead ends: 1311 [2024-11-11 20:31:48,157 INFO L226 Difference]: Without dead ends: 778 [2024-11-11 20:31:48,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:31:48,159 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1253 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 4970 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 5267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 4970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:48,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1962 Invalid, 5267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 4970 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:31:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-11 20:31:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 602. [2024-11-11 20:31:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 470 states have (on average 1.6148936170212767) internal successors, (759), 491 states have internal predecessors, (759), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 964 transitions. [2024-11-11 20:31:48,232 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 964 transitions. Word has length 71 [2024-11-11 20:31:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 964 transitions. [2024-11-11 20:31:48,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:31:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 964 transitions. [2024-11-11 20:31:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 20:31:48,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:48,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:48,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:31:48,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:48,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1808053432, now seen corresponding path program 1 times [2024-11-11 20:31:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958126330] [2024-11-11 20:31:48,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:31:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958126330] [2024-11-11 20:31:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958126330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:48,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585871330] [2024-11-11 20:31:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:48,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:48,619 INFO L87 Difference]: Start difference. First operand 602 states and 964 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:51,451 INFO L93 Difference]: Finished difference Result 1326 states and 2166 transitions. [2024-11-11 20:31:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:31:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2024-11-11 20:31:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:51,455 INFO L225 Difference]: With dead ends: 1326 [2024-11-11 20:31:51,456 INFO L226 Difference]: Without dead ends: 782 [2024-11-11 20:31:51,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:31:51,457 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 1262 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:51,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 1141 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:31:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-11 20:31:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 602. [2024-11-11 20:31:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 470 states have (on average 1.6042553191489362) internal successors, (754), 491 states have internal predecessors, (754), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 959 transitions. [2024-11-11 20:31:51,520 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 959 transitions. Word has length 71 [2024-11-11 20:31:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:51,520 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 959 transitions. [2024-11-11 20:31:51,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 959 transitions. [2024-11-11 20:31:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 20:31:51,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:51,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:51,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:31:51,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 915910412, now seen corresponding path program 1 times [2024-11-11 20:31:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384897950] [2024-11-11 20:31:51,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:31:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384897950] [2024-11-11 20:31:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384897950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:31:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705408617] [2024-11-11 20:31:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:51,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:31:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:31:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:31:51,965 INFO L87 Difference]: Start difference. First operand 602 states and 959 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:31:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:56,263 INFO L93 Difference]: Finished difference Result 1319 states and 2151 transitions. [2024-11-11 20:31:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:31:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2024-11-11 20:31:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:56,268 INFO L225 Difference]: With dead ends: 1319 [2024-11-11 20:31:56,268 INFO L226 Difference]: Without dead ends: 786 [2024-11-11 20:31:56,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:31:56,270 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 766 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:56,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1994 Invalid, 5209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 5078 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 20:31:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-11 20:31:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 606. [2024-11-11 20:31:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 474 states have (on average 1.59915611814346) internal successors, (758), 495 states have internal predecessors, (758), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 963 transitions. [2024-11-11 20:31:56,354 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 963 transitions. Word has length 72 [2024-11-11 20:31:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 963 transitions. [2024-11-11 20:31:56,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:31:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 963 transitions. [2024-11-11 20:31:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 20:31:56,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:56,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:56,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:31:56,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:56,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1596099499, now seen corresponding path program 1 times [2024-11-11 20:31:56,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883695475] [2024-11-11 20:31:56,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:56,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:31:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:31:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:31:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:31:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:31:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:31:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:31:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:31:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883695475] [2024-11-11 20:31:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883695475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:31:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:31:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:31:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381569310] [2024-11-11 20:31:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:31:56,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:31:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:31:56,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:31:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:31:56,746 INFO L87 Difference]: Start difference. First operand 606 states and 963 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:31:59,874 INFO L93 Difference]: Finished difference Result 1366 states and 2208 transitions. [2024-11-11 20:31:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:31:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-11 20:31:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:31:59,878 INFO L225 Difference]: With dead ends: 1366 [2024-11-11 20:31:59,878 INFO L226 Difference]: Without dead ends: 778 [2024-11-11 20:31:59,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:31:59,880 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 725 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:31:59,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1135 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 20:31:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-11 20:31:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 606. [2024-11-11 20:31:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 474 states have (on average 1.5970464135021096) internal successors, (757), 495 states have internal predecessors, (757), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:31:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 962 transitions. [2024-11-11 20:31:59,944 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 962 transitions. Word has length 72 [2024-11-11 20:31:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:31:59,944 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 962 transitions. [2024-11-11 20:31:59,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:31:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 962 transitions. [2024-11-11 20:31:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 20:31:59,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:31:59,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:31:59,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:31:59,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:31:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:31:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 902706794, now seen corresponding path program 1 times [2024-11-11 20:31:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:31:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931211226] [2024-11-11 20:31:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:31:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:31:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:32:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:32:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:32:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931211226] [2024-11-11 20:32:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931211226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:32:00,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:32:00,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180801911] [2024-11-11 20:32:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:32:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:32:00,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:32:00,378 INFO L87 Difference]: Start difference. First operand 606 states and 962 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:32:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:32:04,608 INFO L93 Difference]: Finished difference Result 1322 states and 2152 transitions. [2024-11-11 20:32:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:32:04,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2024-11-11 20:32:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:32:04,612 INFO L225 Difference]: With dead ends: 1322 [2024-11-11 20:32:04,612 INFO L226 Difference]: Without dead ends: 768 [2024-11-11 20:32:04,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:32:04,614 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1247 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 4974 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 5255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 4974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:32:04,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2050 Invalid, 5255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 4974 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:32:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-11 20:32:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 598. [2024-11-11 20:32:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 466 states have (on average 1.6008583690987124) internal successors, (746), 487 states have internal predecessors, (746), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:32:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 951 transitions. [2024-11-11 20:32:04,678 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 951 transitions. Word has length 72 [2024-11-11 20:32:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:32:04,678 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 951 transitions. [2024-11-11 20:32:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:32:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 951 transitions. [2024-11-11 20:32:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 20:32:04,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:32:04,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:32:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:32:04,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:32:04,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:32:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash 60070075, now seen corresponding path program 1 times [2024-11-11 20:32:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:32:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477369986] [2024-11-11 20:32:04,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:32:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:32:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:05,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:32:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:32:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:05,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477369986] [2024-11-11 20:32:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477369986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:32:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:32:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051654133] [2024-11-11 20:32:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:05,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:32:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:32:05,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:32:05,083 INFO L87 Difference]: Start difference. First operand 598 states and 951 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:32:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:32:08,124 INFO L93 Difference]: Finished difference Result 1311 states and 2135 transitions. [2024-11-11 20:32:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:32:08,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-11 20:32:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:32:08,129 INFO L225 Difference]: With dead ends: 1311 [2024-11-11 20:32:08,129 INFO L226 Difference]: Without dead ends: 778 [2024-11-11 20:32:08,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:32:08,131 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1209 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:32:08,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 1131 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:32:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-11 20:32:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 603. [2024-11-11 20:32:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 471 states have (on average 1.59447983014862) internal successors, (751), 492 states have internal predecessors, (751), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:32:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 956 transitions. [2024-11-11 20:32:08,212 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 956 transitions. Word has length 73 [2024-11-11 20:32:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:32:08,212 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 956 transitions. [2024-11-11 20:32:08,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:32:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 956 transitions. [2024-11-11 20:32:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 20:32:08,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:32:08,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:32:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:32:08,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:32:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:32:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 512425886, now seen corresponding path program 1 times [2024-11-11 20:32:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:32:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835592017] [2024-11-11 20:32:08,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:32:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:32:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:32:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:32:08,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:08,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835592017] [2024-11-11 20:32:08,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835592017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:08,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:32:08,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:32:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621095055] [2024-11-11 20:32:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:08,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:32:08,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:32:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:32:08,584 INFO L87 Difference]: Start difference. First operand 603 states and 956 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:32:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:32:11,694 INFO L93 Difference]: Finished difference Result 1323 states and 2146 transitions. [2024-11-11 20:32:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:32:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2024-11-11 20:32:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:32:11,698 INFO L225 Difference]: With dead ends: 1323 [2024-11-11 20:32:11,698 INFO L226 Difference]: Without dead ends: 769 [2024-11-11 20:32:11,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:32:11,700 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 763 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:32:11,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1151 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 20:32:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-11 20:32:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 603. [2024-11-11 20:32:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 471 states have (on average 1.585987261146497) internal successors, (747), 492 states have internal predecessors, (747), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-11 20:32:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 952 transitions. [2024-11-11 20:32:11,767 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 952 transitions. Word has length 74 [2024-11-11 20:32:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:32:11,767 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 952 transitions. [2024-11-11 20:32:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:32:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 952 transitions. [2024-11-11 20:32:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 20:32:11,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:32:11,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:32:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:32:11,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:32:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:32:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1733153568, now seen corresponding path program 1 times [2024-11-11 20:32:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:32:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328167274] [2024-11-11 20:32:11,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:32:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:11,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:32:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:12,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:12,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:32:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:32:12,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328167274] [2024-11-11 20:32:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328167274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:12,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:32:12,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:32:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184766536] [2024-11-11 20:32:12,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:32:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:12,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:32:12,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:32:12,369 INFO L87 Difference]: Start difference. First operand 603 states and 952 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 20:32:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:32:17,979 INFO L93 Difference]: Finished difference Result 2150 states and 3583 transitions. [2024-11-11 20:32:17,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:32:17,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 74 [2024-11-11 20:32:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:32:17,988 INFO L225 Difference]: With dead ends: 2150 [2024-11-11 20:32:17,988 INFO L226 Difference]: Without dead ends: 1625 [2024-11-11 20:32:17,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:32:17,990 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 3709 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 3148 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3806 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 4139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 3148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:32:17,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3806 Valid, 1503 Invalid, 4139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 3148 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 20:32:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-11 20:32:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1145. [2024-11-11 20:32:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 892 states have (on average 1.6210762331838564) internal successors, (1446), 922 states have internal predecessors, (1446), 204 states have call successors, (204), 47 states have call predecessors, (204), 48 states have return successors, (206), 188 states have call predecessors, (206), 199 states have call successors, (206) [2024-11-11 20:32:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1856 transitions. [2024-11-11 20:32:18,152 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1856 transitions. Word has length 74 [2024-11-11 20:32:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:32:18,152 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1856 transitions. [2024-11-11 20:32:18,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 20:32:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1856 transitions. [2024-11-11 20:32:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:32:18,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:32:18,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:32:18,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:32:18,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:32:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:32:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1237222295, now seen corresponding path program 1 times [2024-11-11 20:32:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:32:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434485043] [2024-11-11 20:32:18,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:32:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:32:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:32:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:32:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:32:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:32:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:32:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:32:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:32:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434485043] [2024-11-11 20:32:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434485043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:32:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558902145] [2024-11-11 20:32:19,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:19,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:32:19,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:32:19,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:32:19,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:32:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:19,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 20:32:19,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:32:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:32:19,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:32:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558902145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:32:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [21] total 27 [2024-11-11 20:32:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239658384] [2024-11-11 20:32:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:19,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:32:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:32:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2024-11-11 20:32:19,795 INFO L87 Difference]: Start difference. First operand 1145 states and 1856 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:32:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:32:22,274 INFO L93 Difference]: Finished difference Result 3212 states and 5273 transitions. [2024-11-11 20:32:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:32:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2024-11-11 20:32:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:32:22,288 INFO L225 Difference]: With dead ends: 3212 [2024-11-11 20:32:22,288 INFO L226 Difference]: Without dead ends: 2143 [2024-11-11 20:32:22,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=1139, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 20:32:22,293 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1766 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 5363 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 5640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 5363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:32:22,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 2063 Invalid, 5640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 5363 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:32:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2024-11-11 20:32:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1969. [2024-11-11 20:32:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1517 states have (on average 1.6090969017798287) internal successors, (2441), 1557 states have internal predecessors, (2441), 362 states have call successors, (362), 77 states have call predecessors, (362), 89 states have return successors, (394), 345 states have call predecessors, (394), 357 states have call successors, (394) [2024-11-11 20:32:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3197 transitions. [2024-11-11 20:32:22,618 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3197 transitions. Word has length 128 [2024-11-11 20:32:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:32:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 3197 transitions. [2024-11-11 20:32:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:32:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3197 transitions. [2024-11-11 20:32:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:32:22,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:32:22,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:32:22,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:32:22,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:32:22,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:32:22,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:32:22,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2142994863, now seen corresponding path program 1 times [2024-11-11 20:32:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:32:22,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350326697] [2024-11-11 20:32:22,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:22,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:32:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:32:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:32:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:32:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:32:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:32:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:32:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:32:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350326697] [2024-11-11 20:32:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350326697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:32:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110412476] [2024-11-11 20:32:23,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:32:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:32:23,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:32:23,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:32:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:24,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:32:24,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:32:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:32:24,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:32:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110412476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:32:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2024-11-11 20:32:24,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326777437] [2024-11-11 20:32:24,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:24,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:32:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:32:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:32:24,236 INFO L87 Difference]: Start difference. First operand 1969 states and 3197 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 20:32:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:32:24,857 INFO L93 Difference]: Finished difference Result 3892 states and 6488 transitions. [2024-11-11 20:32:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:32:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-11 20:32:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:32:24,867 INFO L225 Difference]: With dead ends: 3892 [2024-11-11 20:32:24,867 INFO L226 Difference]: Without dead ends: 2001 [2024-11-11 20:32:24,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:32:24,876 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 894 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:32:24,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2362 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:32:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2024-11-11 20:32:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2024-11-11 20:32:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1545 states have (on average 1.6110032362459548) internal successors, (2489), 1585 states have internal predecessors, (2489), 362 states have call successors, (362), 81 states have call predecessors, (362), 93 states have return successors, (398), 345 states have call predecessors, (398), 357 states have call successors, (398) [2024-11-11 20:32:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3249 transitions. [2024-11-11 20:32:25,205 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3249 transitions. Word has length 129 [2024-11-11 20:32:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:32:25,205 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 3249 transitions. [2024-11-11 20:32:25,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 20:32:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3249 transitions. [2024-11-11 20:32:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:32:25,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:32:25,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:32:25,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:32:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-11 20:32:25,409 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:32:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:32:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1080535205, now seen corresponding path program 1 times [2024-11-11 20:32:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:32:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447529852] [2024-11-11 20:32:25,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:32:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:32:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:25,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:32:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:32:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:32:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:32:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:32:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:32:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:32:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:32:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:32:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:32:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:32:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:32:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447529852] [2024-11-11 20:32:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447529852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:32:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:32:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:32:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402514402] [2024-11-11 20:32:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:32:26,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:32:26,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:32:26,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:32:26,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:32:26,193 INFO L87 Difference]: Start difference. First operand 2001 states and 3249 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 6 states have internal predecessors, (93), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16)