./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_productSimulator.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.graphml --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 103200f2b8a63084e18f01e764726e643d8bd1fdb49b70f8e60a3d1bb82c2b32 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 05:55:51,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 05:55:51,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 05:55:51,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 05:55:51,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 05:55:51,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 05:55:51,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 05:55:51,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 05:55:51,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 05:55:51,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 05:55:51,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 05:55:51,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 05:55:51,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 05:55:51,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 05:55:51,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 05:55:51,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 05:55:51,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 05:55:51,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 05:55:51,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 05:55:51,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 05:55:51,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 05:55:51,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 05:55:51,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 05:55:51,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 05:55:51,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 05:55:51,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 05:55:51,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 05:55:51,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 05:55:51,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 05:55:51,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 05:55:51,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 05:55:51,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 05:55:51,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 05:55:51,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 05:55:51,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 05:55:51,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 05:55:51,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 05:55:51,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 05:55:51,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 05:55:51,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 05:55:51,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 05:55:51,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 05:55:51,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 05:55:51,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 05:55:51,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 05:55:51,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 05:55:51,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 05:55:51,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 05:55:51,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 05:55:51,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 05:55:51,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 05:55:51,357 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 05:55:51,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 05:55:51,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 05:55:51,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 05:55:51,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 05:55:51,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 05:55:51,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 05:55:51,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 05:55:51,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 05:55:51,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 05:55:51,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 05:55:51,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 05:55:51,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 05:55:51,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 05:55:51,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 05:55:51,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 05:55:51,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:55:51,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 05:55:51,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 05:55:51,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 05:55:51,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 05:55:51,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 05:55:51,363 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 05:55:51,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 05:55:51,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 05:55:51,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 103200f2b8a63084e18f01e764726e643d8bd1fdb49b70f8e60a3d1bb82c2b32 [2022-07-12 05:55:51,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 05:55:51,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 05:55:51,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 05:55:51,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 05:55:51,614 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 05:55:51,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_productSimulator.cil.c [2022-07-12 05:55:51,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4539e0347/8f848b3b0c324548a2ab707063f5df46/FLAGca29b21fe [2022-07-12 05:55:52,156 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 05:55:52,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_productSimulator.cil.c [2022-07-12 05:55:52,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4539e0347/8f848b3b0c324548a2ab707063f5df46/FLAGca29b21fe [2022-07-12 05:55:52,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4539e0347/8f848b3b0c324548a2ab707063f5df46 [2022-07-12 05:55:52,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 05:55:52,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 05:55:52,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 05:55:52,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 05:55:52,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 05:55:52,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:55:52" (1/1) ... [2022-07-12 05:55:52,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc6c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:52, skipping insertion in model container [2022-07-12 05:55:52,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:55:52" (1/1) ... [2022-07-12 05:55:52,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 05:55:52,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 05:55:52,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_productSimulator.cil.c[36997,37010] [2022-07-12 05:55:52,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:55:52,974 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 05:55:53,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_productSimulator.cil.c[36997,37010] [2022-07-12 05:55:53,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:55:53,148 INFO L208 MainTranslator]: Completed translation [2022-07-12 05:55:53,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53 WrapperNode [2022-07-12 05:55:53,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 05:55:53,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 05:55:53,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 05:55:53,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 05:55:53,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,246 INFO L137 Inliner]: procedures = 110, calls = 379, calls flagged for inlining = 32, calls inlined = 28, statements flattened = 1000 [2022-07-12 05:55:53,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 05:55:53,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 05:55:53,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 05:55:53,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 05:55:53,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 05:55:53,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 05:55:53,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 05:55:53,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 05:55:53,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (1/1) ... [2022-07-12 05:55:53,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:55:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:55:53,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 05:55:53,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 05:55:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2022-07-12 05:55:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2022-07-12 05:55:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2022-07-12 05:55:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2022-07-12 05:55:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2022-07-12 05:55:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2022-07-12 05:55:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2022-07-12 05:55:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2022-07-12 05:55:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-07-12 05:55:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-07-12 05:55:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2022-07-12 05:55:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2022-07-12 05:55:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2022-07-12 05:55:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2022-07-12 05:55:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2022-07-12 05:55:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2022-07-12 05:55:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2022-07-12 05:55:53,440 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2022-07-12 05:55:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2022-07-12 05:55:53,440 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2022-07-12 05:55:53,440 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2022-07-12 05:55:53,440 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2022-07-12 05:55:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2022-07-12 05:55:53,441 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2022-07-12 05:55:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2022-07-12 05:55:53,441 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2022-07-12 05:55:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 05:55:53,441 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2022-07-12 05:55:53,441 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2022-07-12 05:55:53,442 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2022-07-12 05:55:53,442 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2022-07-12 05:55:53,442 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2022-07-12 05:55:53,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2022-07-12 05:55:53,442 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2022-07-12 05:55:53,442 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2022-07-12 05:55:53,442 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-12 05:55:53,443 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-12 05:55:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2022-07-12 05:55:53,443 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2022-07-12 05:55:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2022-07-12 05:55:53,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2022-07-12 05:55:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2022-07-12 05:55:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2022-07-12 05:55:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2022-07-12 05:55:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2022-07-12 05:55:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2022-07-12 05:55:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2022-07-12 05:55:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2022-07-12 05:55:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2022-07-12 05:55:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2022-07-12 05:55:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2022-07-12 05:55:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2022-07-12 05:55:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2022-07-12 05:55:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2022-07-12 05:55:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2022-07-12 05:55:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2022-07-12 05:55:53,446 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2022-07-12 05:55:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2022-07-12 05:55:53,446 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2022-07-12 05:55:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2022-07-12 05:55:53,446 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2022-07-12 05:55:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2022-07-12 05:55:53,446 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2022-07-12 05:55:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 05:55:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2022-07-12 05:55:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2022-07-12 05:55:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2022-07-12 05:55:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2022-07-12 05:55:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2022-07-12 05:55:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2022-07-12 05:55:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 05:55:53,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 05:55:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2022-07-12 05:55:53,448 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2022-07-12 05:55:53,614 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 05:55:53,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 05:55:54,563 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 05:55:54,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 05:55:54,575 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 05:55:54,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:55:54 BoogieIcfgContainer [2022-07-12 05:55:54,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 05:55:54,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 05:55:54,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 05:55:54,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 05:55:54,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:55:52" (1/3) ... [2022-07-12 05:55:54,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c714c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:55:54, skipping insertion in model container [2022-07-12 05:55:54,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:55:53" (2/3) ... [2022-07-12 05:55:54,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c714c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:55:54, skipping insertion in model container [2022-07-12 05:55:54,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:55:54" (3/3) ... [2022-07-12 05:55:54,585 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec9_productSimulator.cil.c [2022-07-12 05:55:54,597 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 05:55:54,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 05:55:54,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 05:55:54,677 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e748a76, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@368d3207 [2022-07-12 05:55:54,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 05:55:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 669 states, 509 states have (on average 1.6483300589390963) internal successors, (839), 536 states have internal predecessors, (839), 123 states have call successors, (123), 35 states have call predecessors, (123), 35 states have return successors, (123), 115 states have call predecessors, (123), 123 states have call successors, (123) [2022-07-12 05:55:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 05:55:54,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:55:54,714 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:55:54,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:55:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:55:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash 109175043, now seen corresponding path program 1 times [2022-07-12 05:55:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:55:54,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906830277] [2022-07-12 05:55:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:55:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:55:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:55:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:55:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:55:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:55:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:55:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:55:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:55:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:55:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 05:55:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:55:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:55:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:55:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:55:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:55:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:55:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:55:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:55:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906830277] [2022-07-12 05:55:55,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906830277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:55:55,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:55:55,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 05:55:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735083132] [2022-07-12 05:55:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:55:55,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 05:55:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:55:55,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 05:55:55,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 05:55:55,697 INFO L87 Difference]: Start difference. First operand has 669 states, 509 states have (on average 1.6483300589390963) internal successors, (839), 536 states have internal predecessors, (839), 123 states have call successors, (123), 35 states have call predecessors, (123), 35 states have return successors, (123), 115 states have call predecessors, (123), 123 states have call successors, (123) Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:03,501 INFO L93 Difference]: Finished difference Result 1657 states and 2812 transitions. [2022-07-12 05:56:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 05:56:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2022-07-12 05:56:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:03,532 INFO L225 Difference]: With dead ends: 1657 [2022-07-12 05:56:03,532 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:03,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:56:03,546 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 1093 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 5194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:03,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 2431 Invalid, 5194 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [366 Valid, 4828 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-12 05:56:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.640159045725646) internal successors, (825), 528 states have internal predecessors, (825), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1066 transitions. [2022-07-12 05:56:03,742 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1066 transitions. Word has length 93 [2022-07-12 05:56:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:03,743 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1066 transitions. [2022-07-12 05:56:03,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1066 transitions. [2022-07-12 05:56:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 05:56:03,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:03,755 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:03,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 05:56:03,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1921289236, now seen corresponding path program 1 times [2022-07-12 05:56:03,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:03,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098605649] [2022-07-12 05:56:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:56:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 05:56:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:04,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098605649] [2022-07-12 05:56:04,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098605649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:04,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:04,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:04,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015933729] [2022-07-12 05:56:04,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:04,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:04,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:04,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:04,193 INFO L87 Difference]: Start difference. First operand 661 states and 1066 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:09,961 INFO L93 Difference]: Finished difference Result 1620 states and 2744 transitions. [2022-07-12 05:56:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:56:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2022-07-12 05:56:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:09,975 INFO L225 Difference]: With dead ends: 1620 [2022-07-12 05:56:09,976 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:09,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:56:09,981 INFO L413 NwaCegarLoop]: 1030 mSDtfsCounter, 2170 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 4038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:09,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 2026 Invalid, 4038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 05:56:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.6381709741550696) internal successors, (824), 528 states have internal predecessors, (824), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1065 transitions. [2022-07-12 05:56:10,083 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1065 transitions. Word has length 96 [2022-07-12 05:56:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:10,084 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1065 transitions. [2022-07-12 05:56:10,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1065 transitions. [2022-07-12 05:56:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 05:56:10,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:10,087 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 05:56:10,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash 661579003, now seen corresponding path program 1 times [2022-07-12 05:56:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:10,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50463276] [2022-07-12 05:56:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:56:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:10,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50463276] [2022-07-12 05:56:10,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50463276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:10,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:10,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782428876] [2022-07-12 05:56:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:10,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:10,505 INFO L87 Difference]: Start difference. First operand 661 states and 1065 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:15,860 INFO L93 Difference]: Finished difference Result 1620 states and 2743 transitions. [2022-07-12 05:56:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:56:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2022-07-12 05:56:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:15,867 INFO L225 Difference]: With dead ends: 1620 [2022-07-12 05:56:15,867 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:15,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:56:15,875 INFO L413 NwaCegarLoop]: 1024 mSDtfsCounter, 1630 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 3393 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 3393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:15,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 2040 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 3393 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:56:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.636182902584493) internal successors, (823), 528 states have internal predecessors, (823), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1064 transitions. [2022-07-12 05:56:15,947 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1064 transitions. Word has length 97 [2022-07-12 05:56:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:15,947 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1064 transitions. [2022-07-12 05:56:15,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1064 transitions. [2022-07-12 05:56:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 05:56:15,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:15,954 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:15,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 05:56:15,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1256129032, now seen corresponding path program 1 times [2022-07-12 05:56:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:15,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648982104] [2022-07-12 05:56:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 05:56:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:16,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:16,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648982104] [2022-07-12 05:56:16,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648982104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:16,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:16,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517284706] [2022-07-12 05:56:16,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:16,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:16,321 INFO L87 Difference]: Start difference. First operand 661 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:21,778 INFO L93 Difference]: Finished difference Result 1620 states and 2742 transitions. [2022-07-12 05:56:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:56:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2022-07-12 05:56:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:21,785 INFO L225 Difference]: With dead ends: 1620 [2022-07-12 05:56:21,786 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:21,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:56:21,790 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 2166 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2274 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:21,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2274 Valid, 2004 Invalid, 4060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:56:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.6341948310139165) internal successors, (822), 528 states have internal predecessors, (822), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1063 transitions. [2022-07-12 05:56:21,851 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1063 transitions. Word has length 98 [2022-07-12 05:56:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:21,852 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1063 transitions. [2022-07-12 05:56:21,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1063 transitions. [2022-07-12 05:56:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 05:56:21,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:21,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:21,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 05:56:21,856 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2096932449, now seen corresponding path program 1 times [2022-07-12 05:56:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:21,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869119353] [2022-07-12 05:56:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 05:56:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 05:56:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:22,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869119353] [2022-07-12 05:56:22,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869119353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:22,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:22,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285177645] [2022-07-12 05:56:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:22,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:22,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:22,244 INFO L87 Difference]: Start difference. First operand 661 states and 1063 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:28,422 INFO L93 Difference]: Finished difference Result 1620 states and 2741 transitions. [2022-07-12 05:56:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:56:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2022-07-12 05:56:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:28,428 INFO L225 Difference]: With dead ends: 1620 [2022-07-12 05:56:28,428 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:28,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:56:28,432 INFO L413 NwaCegarLoop]: 1021 mSDtfsCounter, 1081 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 3653 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 4020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 3653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:28,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 2050 Invalid, 4020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 3653 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 05:56:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.63220675944334) internal successors, (821), 528 states have internal predecessors, (821), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1062 transitions. [2022-07-12 05:56:28,496 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1062 transitions. Word has length 99 [2022-07-12 05:56:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:28,497 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1062 transitions. [2022-07-12 05:56:28,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1062 transitions. [2022-07-12 05:56:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 05:56:28,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:28,499 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:28,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 05:56:28,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash 381536220, now seen corresponding path program 1 times [2022-07-12 05:56:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095413473] [2022-07-12 05:56:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 05:56:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 05:56:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:28,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095413473] [2022-07-12 05:56:28,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095413473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:28,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:28,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864115895] [2022-07-12 05:56:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:28,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:28,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:28,849 INFO L87 Difference]: Start difference. First operand 661 states and 1062 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:34,209 INFO L93 Difference]: Finished difference Result 1620 states and 2740 transitions. [2022-07-12 05:56:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:56:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2022-07-12 05:56:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:34,216 INFO L225 Difference]: With dead ends: 1620 [2022-07-12 05:56:34,216 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:34,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:56:34,220 INFO L413 NwaCegarLoop]: 1020 mSDtfsCounter, 2160 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 3289 mSolverCounterSat, 773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 773 IncrementalHoareTripleChecker+Valid, 3289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:34,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 1996 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [773 Valid, 3289 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-12 05:56:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.6302186878727634) internal successors, (820), 528 states have internal predecessors, (820), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1061 transitions. [2022-07-12 05:56:34,287 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1061 transitions. Word has length 100 [2022-07-12 05:56:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:34,287 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1061 transitions. [2022-07-12 05:56:34,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1061 transitions. [2022-07-12 05:56:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 05:56:34,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:34,290 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:34,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 05:56:34,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1616742845, now seen corresponding path program 1 times [2022-07-12 05:56:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:34,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300197381] [2022-07-12 05:56:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:34,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:56:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 05:56:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300197381] [2022-07-12 05:56:34,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300197381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:34,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:34,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701018074] [2022-07-12 05:56:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:34,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:34,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:34,636 INFO L87 Difference]: Start difference. First operand 661 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:40,779 INFO L93 Difference]: Finished difference Result 1580 states and 2664 transitions. [2022-07-12 05:56:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:56:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 101 [2022-07-12 05:56:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:40,784 INFO L225 Difference]: With dead ends: 1580 [2022-07-12 05:56:40,784 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:40,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:56:40,787 INFO L413 NwaCegarLoop]: 970 mSDtfsCounter, 1127 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:40,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 2001 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 05:56:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.6202783300198806) internal successors, (815), 528 states have internal predecessors, (815), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1056 transitions. [2022-07-12 05:56:40,853 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1056 transitions. Word has length 101 [2022-07-12 05:56:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:40,854 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1056 transitions. [2022-07-12 05:56:40,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1056 transitions. [2022-07-12 05:56:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 05:56:40,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:40,856 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:40,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 05:56:40,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2068630596, now seen corresponding path program 1 times [2022-07-12 05:56:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:40,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173078234] [2022-07-12 05:56:40,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:56:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 05:56:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:41,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173078234] [2022-07-12 05:56:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173078234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:41,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136570685] [2022-07-12 05:56:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:41,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:41,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:41,193 INFO L87 Difference]: Start difference. First operand 661 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:47,158 INFO L93 Difference]: Finished difference Result 1580 states and 2659 transitions. [2022-07-12 05:56:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:56:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2022-07-12 05:56:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:47,164 INFO L225 Difference]: With dead ends: 1580 [2022-07-12 05:56:47,164 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:47,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:56:47,167 INFO L413 NwaCegarLoop]: 970 mSDtfsCounter, 1126 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 3574 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 3574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:47,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2006 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 3574 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 05:56:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.610337972166998) internal successors, (810), 528 states have internal predecessors, (810), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1051 transitions. [2022-07-12 05:56:47,235 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1051 transitions. Word has length 102 [2022-07-12 05:56:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:47,236 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1051 transitions. [2022-07-12 05:56:47,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1051 transitions. [2022-07-12 05:56:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 05:56:47,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:47,239 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 05:56:47,239 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1655656126, now seen corresponding path program 1 times [2022-07-12 05:56:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:47,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911054067] [2022-07-12 05:56:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:56:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 05:56:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:47,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911054067] [2022-07-12 05:56:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911054067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:47,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056852317] [2022-07-12 05:56:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:47,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:47,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:47,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:47,565 INFO L87 Difference]: Start difference. First operand 661 states and 1051 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:52,867 INFO L93 Difference]: Finished difference Result 1580 states and 2654 transitions. [2022-07-12 05:56:52,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:56:52,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 103 [2022-07-12 05:56:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:52,874 INFO L225 Difference]: With dead ends: 1580 [2022-07-12 05:56:52,874 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:52,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:56:52,877 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 1665 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 3334 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 3334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:52,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 1976 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 3334 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:56:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.6003976143141152) internal successors, (805), 528 states have internal predecessors, (805), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1046 transitions. [2022-07-12 05:56:52,949 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1046 transitions. Word has length 103 [2022-07-12 05:56:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:52,949 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1046 transitions. [2022-07-12 05:56:52,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1046 transitions. [2022-07-12 05:56:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 05:56:52,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:52,952 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:52,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 05:56:52,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1697365335, now seen corresponding path program 1 times [2022-07-12 05:56:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:52,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159858700] [2022-07-12 05:56:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:56:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 05:56:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:53,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159858700] [2022-07-12 05:56:53,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159858700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:53,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:53,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646656607] [2022-07-12 05:56:53,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:53,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:53,269 INFO L87 Difference]: Start difference. First operand 661 states and 1046 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:56:58,369 INFO L93 Difference]: Finished difference Result 1580 states and 2649 transitions. [2022-07-12 05:56:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:56:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2022-07-12 05:56:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:56:58,374 INFO L225 Difference]: With dead ends: 1580 [2022-07-12 05:56:58,374 INFO L226 Difference]: Without dead ends: 996 [2022-07-12 05:56:58,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:56:58,376 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 2220 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 3984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:56:58,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 1954 Invalid, 3984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 05:56:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-07-12 05:56:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 661. [2022-07-12 05:56:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 503 states have (on average 1.5904572564612327) internal successors, (800), 528 states have internal predecessors, (800), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:56:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1041 transitions. [2022-07-12 05:56:58,447 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1041 transitions. Word has length 104 [2022-07-12 05:56:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:56:58,447 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1041 transitions. [2022-07-12 05:56:58,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:56:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1041 transitions. [2022-07-12 05:56:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 05:56:58,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:56:58,450 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:56:58,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 05:56:58,450 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:56:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:56:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1989669034, now seen corresponding path program 1 times [2022-07-12 05:56:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:56:58,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760148240] [2022-07-12 05:56:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:56:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:56:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:56:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:56:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:56:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:56:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:56:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:56:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:56:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 05:56:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:56:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:56:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:56:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:56:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:56:58,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:56:58,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760148240] [2022-07-12 05:56:58,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760148240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:56:58,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:56:58,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:56:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104970940] [2022-07-12 05:56:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:56:58,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:56:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:56:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:56:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:56:58,808 INFO L87 Difference]: Start difference. First operand 661 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:04,174 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2022-07-12 05:57:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 05:57:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2022-07-12 05:57:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:04,181 INFO L225 Difference]: With dead ends: 1595 [2022-07-12 05:57:04,181 INFO L226 Difference]: Without dead ends: 1017 [2022-07-12 05:57:04,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 05:57:04,184 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 2219 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:04,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 1959 Invalid, 3989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 05:57:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-07-12 05:57:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 663. [2022-07-12 05:57:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 505 states have (on average 1.5881188118811882) internal successors, (802), 530 states have internal predecessors, (802), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:57:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1043 transitions. [2022-07-12 05:57:04,258 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1043 transitions. Word has length 104 [2022-07-12 05:57:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:04,258 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1043 transitions. [2022-07-12 05:57:04,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1043 transitions. [2022-07-12 05:57:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 05:57:04,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:04,261 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:04,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 05:57:04,261 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash -751678663, now seen corresponding path program 1 times [2022-07-12 05:57:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:04,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930857401] [2022-07-12 05:57:04,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:57:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:04,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:04,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930857401] [2022-07-12 05:57:04,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930857401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:04,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:04,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930265350] [2022-07-12 05:57:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:04,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:04,596 INFO L87 Difference]: Start difference. First operand 663 states and 1043 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:10,676 INFO L93 Difference]: Finished difference Result 1586 states and 2650 transitions. [2022-07-12 05:57:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:57:10,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2022-07-12 05:57:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:10,682 INFO L225 Difference]: With dead ends: 1586 [2022-07-12 05:57:10,683 INFO L226 Difference]: Without dead ends: 1000 [2022-07-12 05:57:10,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:57:10,686 INFO L413 NwaCegarLoop]: 970 mSDtfsCounter, 1137 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:10,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1996 Invalid, 3928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 05:57:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-07-12 05:57:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 663. [2022-07-12 05:57:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 505 states have (on average 1.5782178217821783) internal successors, (797), 530 states have internal predecessors, (797), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:57:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1038 transitions. [2022-07-12 05:57:10,763 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1038 transitions. Word has length 105 [2022-07-12 05:57:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:10,764 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1038 transitions. [2022-07-12 05:57:10,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1038 transitions. [2022-07-12 05:57:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 05:57:10,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:10,766 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:10,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 05:57:10,766 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1503669340, now seen corresponding path program 1 times [2022-07-12 05:57:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:10,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827168014] [2022-07-12 05:57:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 05:57:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:11,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827168014] [2022-07-12 05:57:11,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827168014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:11,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:11,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459028229] [2022-07-12 05:57:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:11,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:11,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:11,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:11,094 INFO L87 Difference]: Start difference. First operand 663 states and 1038 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:17,369 INFO L93 Difference]: Finished difference Result 1599 states and 2661 transitions. [2022-07-12 05:57:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 05:57:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2022-07-12 05:57:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:17,374 INFO L225 Difference]: With dead ends: 1599 [2022-07-12 05:57:17,374 INFO L226 Difference]: Without dead ends: 1021 [2022-07-12 05:57:17,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 05:57:17,377 INFO L413 NwaCegarLoop]: 981 mSDtfsCounter, 1135 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 3512 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 3887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 3512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:17,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 2022 Invalid, 3887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 3512 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 05:57:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-07-12 05:57:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 666. [2022-07-12 05:57:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 508 states have (on average 1.5748031496062993) internal successors, (800), 533 states have internal predecessors, (800), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:57:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1041 transitions. [2022-07-12 05:57:17,457 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1041 transitions. Word has length 105 [2022-07-12 05:57:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:17,457 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 1041 transitions. [2022-07-12 05:57:17,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1041 transitions. [2022-07-12 05:57:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 05:57:17,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:17,460 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:17,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 05:57:17,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1190306546, now seen corresponding path program 1 times [2022-07-12 05:57:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:17,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020977249] [2022-07-12 05:57:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:57:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:17,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020977249] [2022-07-12 05:57:17,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020977249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:17,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:17,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:57:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553405196] [2022-07-12 05:57:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:57:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:57:17,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:57:17,796 INFO L87 Difference]: Start difference. First operand 666 states and 1041 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 05:57:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:24,815 INFO L93 Difference]: Finished difference Result 1603 states and 2667 transitions. [2022-07-12 05:57:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:57:24,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2022-07-12 05:57:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:24,822 INFO L225 Difference]: With dead ends: 1603 [2022-07-12 05:57:24,822 INFO L226 Difference]: Without dead ends: 1028 [2022-07-12 05:57:24,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:57:24,825 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 1689 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 6687 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 7248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 6687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:24,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2976 Invalid, 7248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 6687 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 05:57:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-07-12 05:57:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 677. [2022-07-12 05:57:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 516 states have (on average 1.571705426356589) internal successors, (811), 543 states have internal predecessors, (811), 124 states have call successors, (124), 35 states have call predecessors, (124), 36 states have return successors, (121), 115 states have call predecessors, (121), 119 states have call successors, (121) [2022-07-12 05:57:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1056 transitions. [2022-07-12 05:57:24,910 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1056 transitions. Word has length 106 [2022-07-12 05:57:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:24,910 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 1056 transitions. [2022-07-12 05:57:24,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 05:57:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1056 transitions. [2022-07-12 05:57:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 05:57:24,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:24,913 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:24,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 05:57:24,913 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash 801207345, now seen corresponding path program 1 times [2022-07-12 05:57:24,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:24,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276710257] [2022-07-12 05:57:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:57:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:25,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276710257] [2022-07-12 05:57:25,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276710257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:25,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:25,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050519256] [2022-07-12 05:57:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:25,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:25,247 INFO L87 Difference]: Start difference. First operand 677 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:30,772 INFO L93 Difference]: Finished difference Result 1626 states and 2698 transitions. [2022-07-12 05:57:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 05:57:30,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2022-07-12 05:57:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:30,778 INFO L225 Difference]: With dead ends: 1626 [2022-07-12 05:57:30,778 INFO L226 Difference]: Without dead ends: 1045 [2022-07-12 05:57:30,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 05:57:30,781 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 2223 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:30,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 1947 Invalid, 3944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:57:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-07-12 05:57:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 681. [2022-07-12 05:57:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 520 states have (on average 1.5653846153846154) internal successors, (814), 547 states have internal predecessors, (814), 124 states have call successors, (124), 35 states have call predecessors, (124), 36 states have return successors, (121), 115 states have call predecessors, (121), 119 states have call successors, (121) [2022-07-12 05:57:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1059 transitions. [2022-07-12 05:57:30,864 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1059 transitions. Word has length 106 [2022-07-12 05:57:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:30,864 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 1059 transitions. [2022-07-12 05:57:30,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1059 transitions. [2022-07-12 05:57:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 05:57:30,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:30,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:30,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 05:57:30,867 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1291218513, now seen corresponding path program 1 times [2022-07-12 05:57:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:30,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974808681] [2022-07-12 05:57:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:57:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:31,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974808681] [2022-07-12 05:57:31,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974808681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:31,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:31,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:31,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85609648] [2022-07-12 05:57:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:31,145 INFO L87 Difference]: Start difference. First operand 681 states and 1059 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:36,959 INFO L93 Difference]: Finished difference Result 1668 states and 2741 transitions. [2022-07-12 05:57:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:57:36,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2022-07-12 05:57:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:36,964 INFO L225 Difference]: With dead ends: 1668 [2022-07-12 05:57:36,964 INFO L226 Difference]: Without dead ends: 1004 [2022-07-12 05:57:36,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:57:36,966 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 1050 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 3519 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 3890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 3519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:36,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 2003 Invalid, 3890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 3519 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-12 05:57:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-07-12 05:57:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 662. [2022-07-12 05:57:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 504 states have (on average 1.5714285714285714) internal successors, (792), 529 states have internal predecessors, (792), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:57:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1033 transitions. [2022-07-12 05:57:37,062 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1033 transitions. Word has length 106 [2022-07-12 05:57:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:37,062 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1033 transitions. [2022-07-12 05:57:37,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1033 transitions. [2022-07-12 05:57:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 05:57:37,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:37,064 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:37,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 05:57:37,065 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:37,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1122047209, now seen corresponding path program 1 times [2022-07-12 05:57:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:37,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370871883] [2022-07-12 05:57:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:57:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:37,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370871883] [2022-07-12 05:57:37,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370871883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:37,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:37,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:57:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487763010] [2022-07-12 05:57:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:37,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:57:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:57:37,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:57:37,352 INFO L87 Difference]: Start difference. First operand 662 states and 1033 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:42,769 INFO L93 Difference]: Finished difference Result 1603 states and 2656 transitions. [2022-07-12 05:57:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 05:57:42,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2022-07-12 05:57:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:42,775 INFO L225 Difference]: With dead ends: 1603 [2022-07-12 05:57:42,775 INFO L226 Difference]: Without dead ends: 1025 [2022-07-12 05:57:42,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 05:57:42,778 INFO L413 NwaCegarLoop]: 979 mSDtfsCounter, 1634 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 3303 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 3303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:42,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1968 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 3303 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-12 05:57:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-07-12 05:57:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 667. [2022-07-12 05:57:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 509 states have (on average 1.5658153241650294) internal successors, (797), 534 states have internal predecessors, (797), 123 states have call successors, (123), 35 states have call predecessors, (123), 34 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2022-07-12 05:57:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1038 transitions. [2022-07-12 05:57:42,848 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1038 transitions. Word has length 107 [2022-07-12 05:57:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:42,848 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 1038 transitions. [2022-07-12 05:57:42,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1038 transitions. [2022-07-12 05:57:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 05:57:42,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:42,850 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:57:42,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 05:57:42,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 756039932, now seen corresponding path program 1 times [2022-07-12 05:57:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419820807] [2022-07-12 05:57:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:57:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:57:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:57:43,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:43,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419820807] [2022-07-12 05:57:43,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419820807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:43,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:43,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 05:57:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044776747] [2022-07-12 05:57:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:43,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 05:57:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:43,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 05:57:43,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 05:57:43,202 INFO L87 Difference]: Start difference. First operand 667 states and 1038 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:57:53,873 INFO L93 Difference]: Finished difference Result 2570 states and 4341 transitions. [2022-07-12 05:57:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 05:57:53,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2022-07-12 05:57:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:57:53,884 INFO L225 Difference]: With dead ends: 2570 [2022-07-12 05:57:53,885 INFO L226 Difference]: Without dead ends: 2000 [2022-07-12 05:57:53,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-07-12 05:57:53,888 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 3939 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 7191 mSolverCounterSat, 1550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4094 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 8741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1550 IncrementalHoareTripleChecker+Valid, 7191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:57:53,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4094 Valid, 2881 Invalid, 8741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1550 Valid, 7191 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-12 05:57:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2022-07-12 05:57:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1298. [2022-07-12 05:57:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 998 states have (on average 1.5681362725450902) internal successors, (1565), 1041 states have internal predecessors, (1565), 230 states have call successors, (230), 68 states have call predecessors, (230), 69 states have return successors, (233), 221 states have call predecessors, (233), 225 states have call successors, (233) [2022-07-12 05:57:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2028 transitions. [2022-07-12 05:57:54,075 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2028 transitions. Word has length 108 [2022-07-12 05:57:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:57:54,075 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 2028 transitions. [2022-07-12 05:57:54,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 05:57:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2028 transitions. [2022-07-12 05:57:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 05:57:54,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:57:54,079 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-12 05:57:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 05:57:54,079 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:57:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:57:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -926049706, now seen corresponding path program 1 times [2022-07-12 05:57:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:57:54,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476101131] [2022-07-12 05:57:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:57:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:57:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:57:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:57:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:57:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:57:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 05:57:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:57:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 05:57:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:57:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:57:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:57:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:57:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:57:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 05:57:54,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:57:54,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476101131] [2022-07-12 05:57:54,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476101131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:57:54,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:57:54,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 05:57:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014511110] [2022-07-12 05:57:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:57:54,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 05:57:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:57:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 05:57:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 05:57:54,456 INFO L87 Difference]: Start difference. First operand 1298 states and 2028 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 05:58:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:58:16,504 INFO L93 Difference]: Finished difference Result 6510 states and 11280 transitions. [2022-07-12 05:58:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-12 05:58:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2022-07-12 05:58:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:58:16,529 INFO L225 Difference]: With dead ends: 6510 [2022-07-12 05:58:16,529 INFO L226 Difference]: Without dead ends: 5387 [2022-07-12 05:58:16,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=558, Invalid=2982, Unknown=0, NotChecked=0, Total=3540 [2022-07-12 05:58:16,538 INFO L413 NwaCegarLoop]: 1320 mSDtfsCounter, 7850 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 16826 mSolverCounterSat, 3607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7892 SdHoareTripleChecker+Valid, 4437 SdHoareTripleChecker+Invalid, 20433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3607 IncrementalHoareTripleChecker+Valid, 16826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-07-12 05:58:16,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7892 Valid, 4437 Invalid, 20433 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3607 Valid, 16826 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2022-07-12 05:58:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2022-07-12 05:58:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 3574. [2022-07-12 05:58:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 2712 states have (on average 1.5759587020648969) internal successors, (4274), 2798 states have internal predecessors, (4274), 645 states have call successors, (645), 196 states have call predecessors, (645), 216 states have return successors, (765), 641 states have call predecessors, (765), 640 states have call successors, (765) [2022-07-12 05:58:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 5684 transitions. [2022-07-12 05:58:17,234 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 5684 transitions. Word has length 115 [2022-07-12 05:58:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:58:17,235 INFO L495 AbstractCegarLoop]: Abstraction has 3574 states and 5684 transitions. [2022-07-12 05:58:17,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 05:58:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 5684 transitions. [2022-07-12 05:58:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 05:58:17,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:58:17,247 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:58:17,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 05:58:17,247 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:58:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:58:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2136683723, now seen corresponding path program 1 times [2022-07-12 05:58:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:58:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836004589] [2022-07-12 05:58:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:58:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:58:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:58:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:58:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:58:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:58:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:58:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:58:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:58:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:58:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:58:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:58:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 05:58:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:58:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:58:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:58:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:58:17,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836004589] [2022-07-12 05:58:17,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836004589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:58:17,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:58:17,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 05:58:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260459902] [2022-07-12 05:58:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:58:17,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 05:58:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:58:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 05:58:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 05:58:17,924 INFO L87 Difference]: Start difference. First operand 3574 states and 5684 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 05:58:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:58:31,212 INFO L93 Difference]: Finished difference Result 10261 states and 18250 transitions. [2022-07-12 05:58:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 05:58:31,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) Word has length 159 [2022-07-12 05:58:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:58:31,251 INFO L225 Difference]: With dead ends: 10261 [2022-07-12 05:58:31,251 INFO L226 Difference]: Without dead ends: 6864 [2022-07-12 05:58:31,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 05:58:31,264 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 5045 mSDsluCounter, 3599 mSDsCounter, 0 mSdLazyCounter, 9877 mSolverCounterSat, 3211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5045 SdHoareTripleChecker+Valid, 4685 SdHoareTripleChecker+Invalid, 13088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3211 IncrementalHoareTripleChecker+Valid, 9877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-12 05:58:31,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5045 Valid, 4685 Invalid, 13088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3211 Valid, 9877 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-07-12 05:58:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6864 states. [2022-07-12 05:58:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6864 to 3644. [2022-07-12 05:58:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 2756 states have (on average 1.5667634252539913) internal successors, (4318), 2846 states have internal predecessors, (4318), 648 states have call successors, (648), 196 states have call predecessors, (648), 239 states have return successors, (820), 660 states have call predecessors, (820), 643 states have call successors, (820) [2022-07-12 05:58:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 5786 transitions. [2022-07-12 05:58:31,916 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 5786 transitions. Word has length 159 [2022-07-12 05:58:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:58:31,916 INFO L495 AbstractCegarLoop]: Abstraction has 3644 states and 5786 transitions. [2022-07-12 05:58:31,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 05:58:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 5786 transitions. [2022-07-12 05:58:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-12 05:58:31,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:58:31,929 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:58:31,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 05:58:31,929 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:58:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:58:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -967806010, now seen corresponding path program 1 times [2022-07-12 05:58:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:58:31,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640839974] [2022-07-12 05:58:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:58:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:58:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:58:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:58:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:58:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:58:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:58:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:58:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:58:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:58:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:58:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:58:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 05:58:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 05:58:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:58:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:58:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 05:58:32,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:58:32,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640839974] [2022-07-12 05:58:32,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640839974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:58:32,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:58:32,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:58:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400417655] [2022-07-12 05:58:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:58:32,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:58:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:58:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:58:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:58:32,484 INFO L87 Difference]: Start difference. First operand 3644 states and 5786 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 5 states have internal predecessors, (105), 5 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-12 05:58:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:58:47,812 INFO L93 Difference]: Finished difference Result 14772 states and 26454 transitions. [2022-07-12 05:58:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 05:58:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 5 states have internal predecessors, (105), 5 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 160 [2022-07-12 05:58:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:58:47,871 INFO L225 Difference]: With dead ends: 14772 [2022-07-12 05:58:47,871 INFO L226 Difference]: Without dead ends: 11305 [2022-07-12 05:58:47,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 05:58:47,893 INFO L413 NwaCegarLoop]: 2086 mSDtfsCounter, 7846 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 5457 mSolverCounterSat, 4075 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7852 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 9532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4075 IncrementalHoareTripleChecker+Valid, 5457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:58:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7852 Valid, 4079 Invalid, 9532 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4075 Valid, 5457 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2022-07-12 05:58:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11305 states. [2022-07-12 05:58:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11305 to 6838. [2022-07-12 05:58:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6838 states, 5191 states have (on average 1.5856289732228859) internal successors, (8231), 5358 states have internal predecessors, (8231), 1199 states have call successors, (1199), 380 states have call predecessors, (1199), 447 states have return successors, (1507), 1217 states have call predecessors, (1507), 1194 states have call successors, (1507) [2022-07-12 05:58:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6838 states to 6838 states and 10937 transitions. [2022-07-12 05:58:48,921 INFO L78 Accepts]: Start accepts. Automaton has 6838 states and 10937 transitions. Word has length 160 [2022-07-12 05:58:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:58:48,922 INFO L495 AbstractCegarLoop]: Abstraction has 6838 states and 10937 transitions. [2022-07-12 05:58:48,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 5 states have internal predecessors, (105), 5 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-07-12 05:58:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 6838 states and 10937 transitions. [2022-07-12 05:58:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 05:58:48,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:58:48,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:58:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 05:58:48,944 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:58:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:58:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 159112028, now seen corresponding path program 1 times [2022-07-12 05:58:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:58:48,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064403933] [2022-07-12 05:58:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:58:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:58:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:58:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:58:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:58:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:58:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:58:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:58:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:58:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:58:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:58:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:58:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:58:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:58:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 05:58:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:58:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:58:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:58:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:58:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 05:58:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:58:49,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064403933] [2022-07-12 05:58:49,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064403933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:58:49,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:58:49,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 05:58:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233958723] [2022-07-12 05:58:49,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:58:49,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 05:58:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:58:49,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 05:58:49,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:58:49,562 INFO L87 Difference]: Start difference. First operand 6838 states and 10937 transitions. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 8 states have internal predecessors, (108), 3 states have call successors, (23), 7 states have call predecessors, (23), 4 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 05:59:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:59:16,532 INFO L93 Difference]: Finished difference Result 29694 states and 55216 transitions. [2022-07-12 05:59:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 05:59:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 8 states have internal predecessors, (108), 3 states have call successors, (23), 7 states have call predecessors, (23), 4 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) Word has length 161 [2022-07-12 05:59:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:59:16,661 INFO L225 Difference]: With dead ends: 29694 [2022-07-12 05:59:16,661 INFO L226 Difference]: Without dead ends: 23049 [2022-07-12 05:59:16,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=302, Invalid=1258, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 05:59:16,706 INFO L413 NwaCegarLoop]: 1481 mSDtfsCounter, 4666 mSDsluCounter, 7749 mSDsCounter, 0 mSdLazyCounter, 17518 mSolverCounterSat, 2806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4779 SdHoareTripleChecker+Valid, 9230 SdHoareTripleChecker+Invalid, 20324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2806 IncrementalHoareTripleChecker+Valid, 17518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:59:16,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4779 Valid, 9230 Invalid, 20324 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2806 Valid, 17518 Invalid, 0 Unknown, 0 Unchecked, 20.6s Time] [2022-07-12 05:59:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23049 states. [2022-07-12 05:59:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23049 to 13224. [2022-07-12 05:59:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13224 states, 10066 states have (on average 1.5874230081462348) internal successors, (15979), 10397 states have internal predecessors, (15979), 2262 states have call successors, (2262), 758 states have call predecessors, (2262), 895 states have return successors, (3112), 2302 states have call predecessors, (3112), 2257 states have call successors, (3112) [2022-07-12 05:59:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13224 states to 13224 states and 21353 transitions. [2022-07-12 05:59:19,191 INFO L78 Accepts]: Start accepts. Automaton has 13224 states and 21353 transitions. Word has length 161 [2022-07-12 05:59:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:59:19,192 INFO L495 AbstractCegarLoop]: Abstraction has 13224 states and 21353 transitions. [2022-07-12 05:59:19,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 8 states have internal predecessors, (108), 3 states have call successors, (23), 7 states have call predecessors, (23), 4 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 05:59:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13224 states and 21353 transitions. [2022-07-12 05:59:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-12 05:59:19,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:59:19,226 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:59:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 05:59:19,226 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:59:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:59:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash 629705659, now seen corresponding path program 1 times [2022-07-12 05:59:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:59:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985535489] [2022-07-12 05:59:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:59:19,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:59:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:59:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:59:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:59:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:59:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:59:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 05:59:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:59:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 05:59:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:59:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:59:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:59:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:59:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:59:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 05:59:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 05:59:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:59:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 05:59:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:59:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985535489] [2022-07-12 05:59:19,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985535489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:59:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496035968] [2022-07-12 05:59:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:59:19,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:59:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:59:19,915 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) [2022-07-12 05:59:19,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 05:59:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:20,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 05:59:20,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:59:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 05:59:20,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:59:20,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496035968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:59:20,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:59:20,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 17 [2022-07-12 05:59:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617599727] [2022-07-12 05:59:20,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:59:20,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:59:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:59:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:59:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-12 05:59:20,459 INFO L87 Difference]: Start difference. First operand 13224 states and 21353 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 05:59:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:59:22,075 INFO L93 Difference]: Finished difference Result 19620 states and 31679 transitions. [2022-07-12 05:59:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:59:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2022-07-12 05:59:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:59:22,139 INFO L225 Difference]: With dead ends: 19620 [2022-07-12 05:59:22,139 INFO L226 Difference]: Without dead ends: 13237 [2022-07-12 05:59:22,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-12 05:59:22,170 INFO L413 NwaCegarLoop]: 1983 mSDtfsCounter, 954 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:59:22,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 2985 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:59:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13237 states. [2022-07-12 05:59:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13237 to 13224. [2022-07-12 05:59:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13224 states, 10066 states have (on average 1.5840453010133122) internal successors, (15945), 10397 states have internal predecessors, (15945), 2262 states have call successors, (2262), 758 states have call predecessors, (2262), 895 states have return successors, (2997), 2302 states have call predecessors, (2997), 2257 states have call successors, (2997) [2022-07-12 05:59:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13224 states to 13224 states and 21204 transitions. [2022-07-12 05:59:24,203 INFO L78 Accepts]: Start accepts. Automaton has 13224 states and 21204 transitions. Word has length 165 [2022-07-12 05:59:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:59:24,204 INFO L495 AbstractCegarLoop]: Abstraction has 13224 states and 21204 transitions. [2022-07-12 05:59:24,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 05:59:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 13224 states and 21204 transitions. [2022-07-12 05:59:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 05:59:24,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:59:24,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:59:24,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 05:59:24,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 05:59:24,451 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:59:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:59:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1072791172, now seen corresponding path program 1 times [2022-07-12 05:59:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:59:24,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967638929] [2022-07-12 05:59:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:59:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:59:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 05:59:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:59:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:59:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 05:59:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:59:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:59:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:59:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 05:59:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:59:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:59:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:59:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 05:59:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:59:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 05:59:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 05:59:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:59:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 05:59:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 05:59:25,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:59:25,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967638929] [2022-07-12 05:59:25,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967638929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:59:25,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995257443] [2022-07-12 05:59:25,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:59:25,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:59:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:59:25,187 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) [2022-07-12 05:59:25,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 05:59:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:59:25,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 05:59:25,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:59:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 05:59:25,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:59:25,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995257443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:59:25,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:59:25,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 18 [2022-07-12 05:59:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719386868] [2022-07-12 05:59:25,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:59:25,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:59:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:59:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:59:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-12 05:59:25,553 INFO L87 Difference]: Start difference. First operand 13224 states and 21204 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 05:59:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:59:28,932 INFO L93 Difference]: Finished difference Result 38921 states and 63212 transitions. [2022-07-12 05:59:28,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:59:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2022-07-12 05:59:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:59:29,082 INFO L225 Difference]: With dead ends: 38921 [2022-07-12 05:59:29,082 INFO L226 Difference]: Without dead ends: 26068 [2022-07-12 05:59:29,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-12 05:59:29,140 INFO L413 NwaCegarLoop]: 1234 mSDtfsCounter, 1010 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:59:29,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 2150 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 05:59:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26068 states.