./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product13.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:43:16,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:43:16,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:43:16,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:43:16,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:43:16,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:43:16,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:43:16,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:43:16,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:43:16,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:43:16,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:43:16,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:43:16,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:43:16,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:43:16,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:43:16,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:43:16,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:43:16,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:43:16,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:43:16,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:43:16,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:43:16,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:43:16,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:43:16,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:43:16,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:43:16,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:43:16,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:43:16,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:43:16,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:43:16,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:43:16,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:43:16,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:43:16,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:43:16,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:43:16,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:43:16,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:43:16,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f [2024-11-11 20:43:16,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:43:16,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:43:16,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:43:16,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:43:16,970 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:43:16,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-11-11 20:43:18,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:43:18,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:43:18,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-11-11 20:43:18,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41a40fdd/71c02e9d52464e3eaaee73077e3411f2/FLAG6812899f6 [2024-11-11 20:43:18,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41a40fdd/71c02e9d52464e3eaaee73077e3411f2 [2024-11-11 20:43:18,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:43:18,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:43:18,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:43:18,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:43:18,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:43:18,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:43:18" (1/1) ... [2024-11-11 20:43:18,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f6176b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:18, skipping insertion in model container [2024-11-11 20:43:18,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:43:18" (1/1) ... [2024-11-11 20:43:18,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:43:19,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c[42804,42817] [2024-11-11 20:43:19,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:43:19,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:43:19,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2024-11-11 20:43:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [90] [2024-11-11 20:43:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [456] [2024-11-11 20:43:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] [2024-11-11 20:43:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [512] [2024-11-11 20:43:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1591] [2024-11-11 20:43:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1871] [2024-11-11 20:43:19,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1880] [2024-11-11 20:43:19,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2093] [2024-11-11 20:43:19,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2504] [2024-11-11 20:43:19,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2758] [2024-11-11 20:43:19,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c[42804,42817] [2024-11-11 20:43:19,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:43:19,228 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:43:19,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19 WrapperNode [2024-11-11 20:43:19,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:43:19,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:43:19,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:43:19,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:43:19,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,317 INFO L138 Inliner]: procedures = 124, calls = 177, calls flagged for inlining = 53, calls inlined = 44, statements flattened = 843 [2024-11-11 20:43:19,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:43:19,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:43:19,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:43:19,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:43:19,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,370 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-11 20:43:19,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:43:19,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:43:19,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:43:19,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:43:19,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (1/1) ... [2024-11-11 20:43:19,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:43:19,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:19,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:43:19,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:43:19,497 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:43:19,497 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:43:19,500 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:43:19,500 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:43:19,500 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:43:19,500 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:43:19,500 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:43:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:43:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:43:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:43:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:43:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:43:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:43:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:43:19,521 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:43:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:43:19,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:43:19,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:43:19,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:43:20,169 INFO L? ?]: Removed 363 outVars from TransFormulas that were not future-live. [2024-11-11 20:43:20,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:43:20,187 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:43:20,188 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:43:20,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:43:20 BoogieIcfgContainer [2024-11-11 20:43:20,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:43:20,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:43:20,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:43:20,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:43:20,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:43:18" (1/3) ... [2024-11-11 20:43:20,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e429182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:43:20, skipping insertion in model container [2024-11-11 20:43:20,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:43:19" (2/3) ... [2024-11-11 20:43:20,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e429182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:43:20, skipping insertion in model container [2024-11-11 20:43:20,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:43:20" (3/3) ... [2024-11-11 20:43:20,194 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product13.cil.c [2024-11-11 20:43:20,207 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:43:20,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:43:20,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:43:20,277 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13aa8575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:43:20,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:43:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 216 states have (on average 1.5509259259259258) internal successors, (335), 218 states have internal predecessors, (335), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-11 20:43:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 20:43:20,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:20,322 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-11 20:43:20,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:20,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1430097031, now seen corresponding path program 1 times [2024-11-11 20:43:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931829506] [2024-11-11 20:43:20,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:43:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:43:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:43:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:43:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:43:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:43:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:43:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:43:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:43:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931829506] [2024-11-11 20:43:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931829506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65038274] [2024-11-11 20:43:21,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:21,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:21,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:21,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:21,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:43:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:43:21,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:43:21,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:43:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65038274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:43:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-11 20:43:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968244625] [2024-11-11 20:43:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:43:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:43:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:43:21,279 INFO L87 Difference]: Start difference. First operand has 271 states, 216 states have (on average 1.5509259259259258) internal successors, (335), 218 states have internal predecessors, (335), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:21,311 INFO L93 Difference]: Finished difference Result 393 states and 580 transitions. [2024-11-11 20:43:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:43:21,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-11-11 20:43:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:21,323 INFO L225 Difference]: With dead ends: 393 [2024-11-11 20:43:21,323 INFO L226 Difference]: Without dead ends: 264 [2024-11-11 20:43:21,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:43:21,331 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:21,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:43:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-11 20:43:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-11 20:43:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 210 states have (on average 1.542857142857143) internal successors, (324), 211 states have internal predecessors, (324), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 20:43:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 397 transitions. [2024-11-11 20:43:21,382 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 397 transitions. Word has length 89 [2024-11-11 20:43:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:21,385 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 397 transitions. [2024-11-11 20:43:21,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 397 transitions. [2024-11-11 20:43:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 20:43:21,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:21,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-11 20:43:21,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:43:21,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:43:21,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:21,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 146243453, now seen corresponding path program 1 times [2024-11-11 20:43:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158387156] [2024-11-11 20:43:21,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:43:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:43:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:43:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:43:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:43:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:43:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:43:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:43:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:43:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158387156] [2024-11-11 20:43:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158387156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439376197] [2024-11-11 20:43:21,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:21,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:43:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:43:22,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:43:22,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:43:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439376197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:43:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:43:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264645744] [2024-11-11 20:43:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:43:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:22,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:43:22,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:43:22,053 INFO L87 Difference]: Start difference. First operand 264 states and 397 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:22,083 INFO L93 Difference]: Finished difference Result 383 states and 561 transitions. [2024-11-11 20:43:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:43:22,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-11-11 20:43:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:22,086 INFO L225 Difference]: With dead ends: 383 [2024-11-11 20:43:22,086 INFO L226 Difference]: Without dead ends: 267 [2024-11-11 20:43:22,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:43:22,090 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:22,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 788 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:43:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-11 20:43:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2024-11-11 20:43:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 212 states have (on average 1.5377358490566038) internal successors, (326), 213 states have internal predecessors, (326), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 20:43:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2024-11-11 20:43:22,119 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 90 [2024-11-11 20:43:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:22,120 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2024-11-11 20:43:22,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2024-11-11 20:43:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 20:43:22,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:22,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:22,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:43:22,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:43:22,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1669237862, now seen corresponding path program 1 times [2024-11-11 20:43:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407081440] [2024-11-11 20:43:22,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:43:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:43:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:43:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:43:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:43:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:43:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:43:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:43:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:43:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407081440] [2024-11-11 20:43:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407081440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722920551] [2024-11-11 20:43:22,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:22,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:22,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:43:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:22,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:43:22,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:43:22,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:43:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722920551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:43:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:43:22,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633667706] [2024-11-11 20:43:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:22,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:43:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:22,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:43:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:43:22,821 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:22,849 INFO L93 Difference]: Finished difference Result 557 states and 849 transitions. [2024-11-11 20:43:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:43:22,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-11 20:43:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:22,852 INFO L225 Difference]: With dead ends: 557 [2024-11-11 20:43:22,852 INFO L226 Difference]: Without dead ends: 318 [2024-11-11 20:43:22,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:43:22,859 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 99 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:22,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 749 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:43:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-11 20:43:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2024-11-11 20:43:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 245 states have (on average 1.5510204081632653) internal successors, (380), 246 states have internal predecessors, (380), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-11 20:43:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 475 transitions. [2024-11-11 20:43:22,876 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 475 transitions. Word has length 96 [2024-11-11 20:43:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:22,877 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 475 transitions. [2024-11-11 20:43:22,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 475 transitions. [2024-11-11 20:43:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 20:43:22,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:22,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:22,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:43:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:23,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -242486194, now seen corresponding path program 1 times [2024-11-11 20:43:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:23,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863732306] [2024-11-11 20:43:23,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:43:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:43:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:43:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:43:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:43:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:43:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:43:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:43:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:43:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863732306] [2024-11-11 20:43:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863732306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355226213] [2024-11-11 20:43:23,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:23,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:23,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:23,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:23,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:43:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:43:23,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:43:23,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:43:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355226213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:23,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:43:23,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 20:43:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127786208] [2024-11-11 20:43:23,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:23,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:43:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:43:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:43:23,534 INFO L87 Difference]: Start difference. First operand 310 states and 475 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:23,584 INFO L93 Difference]: Finished difference Result 611 states and 940 transitions. [2024-11-11 20:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:43:23,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-11 20:43:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:23,588 INFO L225 Difference]: With dead ends: 611 [2024-11-11 20:43:23,588 INFO L226 Difference]: Without dead ends: 312 [2024-11-11 20:43:23,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:43:23,593 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:23,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1545 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:43:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-11 20:43:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-11 20:43:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 246 states have (on average 1.548780487804878) internal successors, (381), 248 states have internal predecessors, (381), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2024-11-11 20:43:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 478 transitions. [2024-11-11 20:43:23,624 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 478 transitions. Word has length 97 [2024-11-11 20:43:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:23,624 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 478 transitions. [2024-11-11 20:43:23,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 478 transitions. [2024-11-11 20:43:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:43:23,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:23,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-11 20:43:23,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:43:23,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:23,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:23,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:23,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1730126550, now seen corresponding path program 1 times [2024-11-11 20:43:23,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:23,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840106348] [2024-11-11 20:43:23,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:23,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:43:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:43:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:43:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:43:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:43:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:43:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:43:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:43:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:23,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840106348] [2024-11-11 20:43:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840106348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:23,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84240378] [2024-11-11 20:43:23,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:23,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:23,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:23,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:23,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:43:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:43:24,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 20:43:24,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:43:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84240378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:24,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:43:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-11 20:43:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718345945] [2024-11-11 20:43:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:43:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:43:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:43:24,243 INFO L87 Difference]: Start difference. First operand 312 states and 478 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:24,297 INFO L93 Difference]: Finished difference Result 613 states and 945 transitions. [2024-11-11 20:43:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:43:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2024-11-11 20:43:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:24,299 INFO L225 Difference]: With dead ends: 613 [2024-11-11 20:43:24,300 INFO L226 Difference]: Without dead ends: 314 [2024-11-11 20:43:24,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:43:24,301 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 2 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:24,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1531 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:43:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-11 20:43:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-11-11 20:43:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.5465587044534412) internal successors, (382), 250 states have internal predecessors, (382), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-11-11 20:43:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 484 transitions. [2024-11-11 20:43:24,315 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 484 transitions. Word has length 98 [2024-11-11 20:43:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:24,315 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 484 transitions. [2024-11-11 20:43:24,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 484 transitions. [2024-11-11 20:43:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:43:24,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:24,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:24,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:43:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:24,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1369225661, now seen corresponding path program 1 times [2024-11-11 20:43:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:24,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251177577] [2024-11-11 20:43:24,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:43:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:43:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:43:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:43:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:43:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:43:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:43:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251177577] [2024-11-11 20:43:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251177577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:43:24,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519704004] [2024-11-11 20:43:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:24,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:43:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:24,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:43:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:43:24,697 INFO L87 Difference]: Start difference. First operand 314 states and 484 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:25,676 INFO L93 Difference]: Finished difference Result 669 states and 1040 transitions. [2024-11-11 20:43:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:43:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2024-11-11 20:43:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:25,679 INFO L225 Difference]: With dead ends: 669 [2024-11-11 20:43:25,679 INFO L226 Difference]: Without dead ends: 378 [2024-11-11 20:43:25,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:43:25,681 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 617 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:25,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 926 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:43:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-11 20:43:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 314. [2024-11-11 20:43:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.5465587044534412) internal successors, (382), 250 states have internal predecessors, (382), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (53), 47 states have call predecessors, (53), 47 states have call successors, (53) [2024-11-11 20:43:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 483 transitions. [2024-11-11 20:43:25,698 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 483 transitions. Word has length 99 [2024-11-11 20:43:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:25,698 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 483 transitions. [2024-11-11 20:43:25,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 483 transitions. [2024-11-11 20:43:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:43:25,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:25,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:43:25,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1151020745, now seen corresponding path program 2 times [2024-11-11 20:43:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140081397] [2024-11-11 20:43:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:43:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:43:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:43:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:43:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:43:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:43:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:43:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:25,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140081397] [2024-11-11 20:43:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140081397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:25,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:43:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236676512] [2024-11-11 20:43:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:25,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:43:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:43:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:43:25,867 INFO L87 Difference]: Start difference. First operand 314 states and 483 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:26,848 INFO L93 Difference]: Finished difference Result 671 states and 1043 transitions. [2024-11-11 20:43:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:43:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-11-11 20:43:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:26,851 INFO L225 Difference]: With dead ends: 671 [2024-11-11 20:43:26,851 INFO L226 Difference]: Without dead ends: 380 [2024-11-11 20:43:26,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:43:26,852 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 614 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:26,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 926 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:43:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-11 20:43:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2024-11-11 20:43:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 248 states have (on average 1.5443548387096775) internal successors, (383), 252 states have internal predecessors, (383), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (55), 47 states have call predecessors, (55), 47 states have call successors, (55) [2024-11-11 20:43:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 486 transitions. [2024-11-11 20:43:26,877 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 486 transitions. Word has length 100 [2024-11-11 20:43:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:26,879 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 486 transitions. [2024-11-11 20:43:26,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:43:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 486 transitions. [2024-11-11 20:43:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:43:26,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:26,883 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:26,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:43:26,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:26,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 257753346, now seen corresponding path program 1 times [2024-11-11 20:43:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181671192] [2024-11-11 20:43:26,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:43:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:43:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:43:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:43:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:43:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:43:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181671192] [2024-11-11 20:43:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181671192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:27,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:43:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060106716] [2024-11-11 20:43:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:27,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:43:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:43:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:43:27,064 INFO L87 Difference]: Start difference. First operand 316 states and 486 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:43:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:28,420 INFO L93 Difference]: Finished difference Result 669 states and 1038 transitions. [2024-11-11 20:43:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:43:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2024-11-11 20:43:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:28,423 INFO L225 Difference]: With dead ends: 669 [2024-11-11 20:43:28,423 INFO L226 Difference]: Without dead ends: 380 [2024-11-11 20:43:28,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:43:28,424 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 617 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:28,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1329 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:43:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-11 20:43:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2024-11-11 20:43:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 248 states have (on average 1.5443548387096775) internal successors, (383), 252 states have internal predecessors, (383), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-11-11 20:43:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 485 transitions. [2024-11-11 20:43:28,438 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 485 transitions. Word has length 101 [2024-11-11 20:43:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:28,438 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 485 transitions. [2024-11-11 20:43:28,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:43:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 485 transitions. [2024-11-11 20:43:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:43:28,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:28,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:28,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:43:28,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:28,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -608894531, now seen corresponding path program 2 times [2024-11-11 20:43:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139068542] [2024-11-11 20:43:28,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:43:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:43:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:43:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:43:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:43:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:43:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139068542] [2024-11-11 20:43:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139068542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:43:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036265136] [2024-11-11 20:43:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:43:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:43:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:43:28,590 INFO L87 Difference]: Start difference. First operand 316 states and 485 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:43:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:29,793 INFO L93 Difference]: Finished difference Result 671 states and 1044 transitions. [2024-11-11 20:43:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:43:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-11-11 20:43:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:29,795 INFO L225 Difference]: With dead ends: 671 [2024-11-11 20:43:29,795 INFO L226 Difference]: Without dead ends: 382 [2024-11-11 20:43:29,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:43:29,796 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 614 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:29,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1330 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:43:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-11 20:43:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 318. [2024-11-11 20:43:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 249 states have (on average 1.5421686746987953) internal successors, (384), 254 states have internal predecessors, (384), 48 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (59), 47 states have call predecessors, (59), 47 states have call successors, (59) [2024-11-11 20:43:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 491 transitions. [2024-11-11 20:43:29,812 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 491 transitions. Word has length 102 [2024-11-11 20:43:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:29,813 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 491 transitions. [2024-11-11 20:43:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:43:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 491 transitions. [2024-11-11 20:43:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:43:29,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:29,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:43:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:43:29,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:29,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash -303425497, now seen corresponding path program 1 times [2024-11-11 20:43:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819499779] [2024-11-11 20:43:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:43:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:43:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:43:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:43:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:43:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819499779] [2024-11-11 20:43:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819499779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773448739] [2024-11-11 20:43:29,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:29,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:29,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:43:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:30,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:43:30,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:30,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:43:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773448739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:43:30,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:43:30,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-11 20:43:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415822082] [2024-11-11 20:43:30,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:43:30,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:43:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:30,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:43:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:30,226 INFO L87 Difference]: Start difference. First operand 318 states and 491 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 20:43:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:31,050 INFO L93 Difference]: Finished difference Result 825 states and 1342 transitions. [2024-11-11 20:43:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:43:31,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-11 20:43:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:31,056 INFO L225 Difference]: With dead ends: 825 [2024-11-11 20:43:31,056 INFO L226 Difference]: Without dead ends: 709 [2024-11-11 20:43:31,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:43:31,058 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1131 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:31,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1161 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:43:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-11 20:43:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 621. [2024-11-11 20:43:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 488 states have (on average 1.6024590163934427) internal successors, (782), 493 states have internal predecessors, (782), 112 states have call successors, (112), 16 states have call predecessors, (112), 20 states have return successors, (133), 111 states have call predecessors, (133), 111 states have call successors, (133) [2024-11-11 20:43:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1027 transitions. [2024-11-11 20:43:31,100 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1027 transitions. Word has length 103 [2024-11-11 20:43:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:31,100 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 1027 transitions. [2024-11-11 20:43:31,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 20:43:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1027 transitions. [2024-11-11 20:43:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:43:31,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:31,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:31,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:43:31,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:31,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:31,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -431869596, now seen corresponding path program 1 times [2024-11-11 20:43:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768731158] [2024-11-11 20:43:31,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:43:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:43:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:43:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:43:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:43:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768731158] [2024-11-11 20:43:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768731158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892239435] [2024-11-11 20:43:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:31,416 INFO L87 Difference]: Start difference. First operand 621 states and 1027 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:32,068 INFO L93 Difference]: Finished difference Result 1546 states and 2621 transitions. [2024-11-11 20:43:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-11 20:43:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:32,073 INFO L225 Difference]: With dead ends: 1546 [2024-11-11 20:43:32,073 INFO L226 Difference]: Without dead ends: 993 [2024-11-11 20:43:32,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:32,076 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 710 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:32,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 661 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:43:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2024-11-11 20:43:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 921. [2024-11-11 20:43:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 724 states have (on average 1.611878453038674) internal successors, (1167), 729 states have internal predecessors, (1167), 176 states have call successors, (176), 16 states have call predecessors, (176), 20 states have return successors, (207), 175 states have call predecessors, (207), 175 states have call successors, (207) [2024-11-11 20:43:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1550 transitions. [2024-11-11 20:43:32,127 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1550 transitions. Word has length 109 [2024-11-11 20:43:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:32,127 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1550 transitions. [2024-11-11 20:43:32,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1550 transitions. [2024-11-11 20:43:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:43:32,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:32,130 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:32,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:43:32,131 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:32,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -285337811, now seen corresponding path program 1 times [2024-11-11 20:43:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770335455] [2024-11-11 20:43:32,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:43:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:43:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:43:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:43:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:43:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:32,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:32,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770335455] [2024-11-11 20:43:32,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770335455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:32,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326432010] [2024-11-11 20:43:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:32,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:32,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:32,208 INFO L87 Difference]: Start difference. First operand 921 states and 1550 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:32,892 INFO L93 Difference]: Finished difference Result 2261 states and 3866 transitions. [2024-11-11 20:43:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-11 20:43:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:32,901 INFO L225 Difference]: With dead ends: 2261 [2024-11-11 20:43:32,901 INFO L226 Difference]: Without dead ends: 1461 [2024-11-11 20:43:32,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:32,906 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 708 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:32,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 648 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:43:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2024-11-11 20:43:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1389. [2024-11-11 20:43:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1097 states have (on average 1.6171376481312671) internal successors, (1774), 1102 states have internal predecessors, (1774), 271 states have call successors, (271), 16 states have call predecessors, (271), 20 states have return successors, (302), 270 states have call predecessors, (302), 270 states have call successors, (302) [2024-11-11 20:43:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2347 transitions. [2024-11-11 20:43:32,982 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2347 transitions. Word has length 110 [2024-11-11 20:43:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:32,982 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 2347 transitions. [2024-11-11 20:43:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2347 transitions. [2024-11-11 20:43:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:43:32,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:32,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:32,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:43:32,988 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:32,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash -630367642, now seen corresponding path program 1 times [2024-11-11 20:43:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886691222] [2024-11-11 20:43:32,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:43:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:43:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:43:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:43:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:43:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886691222] [2024-11-11 20:43:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886691222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811405653] [2024-11-11 20:43:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:33,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:33,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:33,084 INFO L87 Difference]: Start difference. First operand 1389 states and 2347 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:33,720 INFO L93 Difference]: Finished difference Result 3308 states and 5707 transitions. [2024-11-11 20:43:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-11 20:43:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:33,730 INFO L225 Difference]: With dead ends: 3308 [2024-11-11 20:43:33,730 INFO L226 Difference]: Without dead ends: 2165 [2024-11-11 20:43:33,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:33,736 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 706 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:33,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 646 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:43:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2024-11-11 20:43:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2093. [2024-11-11 20:43:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1678 states have (on average 1.6215733015494636) internal successors, (2721), 1683 states have internal predecessors, (2721), 394 states have call successors, (394), 16 states have call predecessors, (394), 20 states have return successors, (441), 393 states have call predecessors, (441), 393 states have call successors, (441) [2024-11-11 20:43:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3556 transitions. [2024-11-11 20:43:33,830 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3556 transitions. Word has length 111 [2024-11-11 20:43:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:33,831 INFO L471 AbstractCegarLoop]: Abstraction has 2093 states and 3556 transitions. [2024-11-11 20:43:33,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3556 transitions. [2024-11-11 20:43:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:43:33,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:33,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:33,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:43:33,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:33,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash 848726510, now seen corresponding path program 1 times [2024-11-11 20:43:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:33,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559645443] [2024-11-11 20:43:33,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:43:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:43:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:43:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:43:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:43:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:33,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:33,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559645443] [2024-11-11 20:43:33,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559645443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:33,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:33,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67804839] [2024-11-11 20:43:33,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:33,919 INFO L87 Difference]: Start difference. First operand 2093 states and 3556 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:34,627 INFO L93 Difference]: Finished difference Result 4927 states and 8561 transitions. [2024-11-11 20:43:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:34,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-11 20:43:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:34,642 INFO L225 Difference]: With dead ends: 4927 [2024-11-11 20:43:34,642 INFO L226 Difference]: Without dead ends: 3284 [2024-11-11 20:43:34,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:34,648 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 704 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:34,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 646 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:43:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2024-11-11 20:43:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3212. [2024-11-11 20:43:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2618 states have (on average 1.624140565317036) internal successors, (4252), 2623 states have internal predecessors, (4252), 573 states have call successors, (573), 16 states have call predecessors, (573), 20 states have return successors, (646), 572 states have call predecessors, (646), 572 states have call successors, (646) [2024-11-11 20:43:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5471 transitions. [2024-11-11 20:43:34,746 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5471 transitions. Word has length 112 [2024-11-11 20:43:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 5471 transitions. [2024-11-11 20:43:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5471 transitions. [2024-11-11 20:43:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:43:34,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:34,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:34,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:43:34,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1608170622, now seen corresponding path program 1 times [2024-11-11 20:43:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244709889] [2024-11-11 20:43:34,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:43:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:43:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:43:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:43:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:43:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:34,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:34,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244709889] [2024-11-11 20:43:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244709889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:34,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:34,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94915959] [2024-11-11 20:43:34,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:34,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:34,825 INFO L87 Difference]: Start difference. First operand 3212 states and 5471 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:35,483 INFO L93 Difference]: Finished difference Result 7845 states and 13660 transitions. [2024-11-11 20:43:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-11 20:43:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:35,512 INFO L225 Difference]: With dead ends: 7845 [2024-11-11 20:43:35,512 INFO L226 Difference]: Without dead ends: 5315 [2024-11-11 20:43:35,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:35,525 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 702 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:35,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 685 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:43:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5315 states. [2024-11-11 20:43:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5315 to 5243. [2024-11-11 20:43:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 4273 states have (on average 1.615726655745378) internal successors, (6904), 4278 states have internal predecessors, (6904), 949 states have call successors, (949), 16 states have call predecessors, (949), 20 states have return successors, (1066), 948 states have call predecessors, (1066), 948 states have call successors, (1066) [2024-11-11 20:43:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 8919 transitions. [2024-11-11 20:43:35,756 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 8919 transitions. Word has length 113 [2024-11-11 20:43:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:35,756 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 8919 transitions. [2024-11-11 20:43:35,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 8919 transitions. [2024-11-11 20:43:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:43:35,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:35,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:43:35,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 334385362, now seen corresponding path program 1 times [2024-11-11 20:43:35,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:35,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018381637] [2024-11-11 20:43:35,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:43:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:43:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:43:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:43:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:43:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018381637] [2024-11-11 20:43:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018381637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198679443] [2024-11-11 20:43:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:35,854 INFO L87 Difference]: Start difference. First operand 5243 states and 8919 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:36,639 INFO L93 Difference]: Finished difference Result 12987 states and 22569 transitions. [2024-11-11 20:43:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-11 20:43:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:36,684 INFO L225 Difference]: With dead ends: 12987 [2024-11-11 20:43:36,684 INFO L226 Difference]: Without dead ends: 8803 [2024-11-11 20:43:36,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:36,699 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 700 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:36,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 647 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:43:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8803 states. [2024-11-11 20:43:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8803 to 8731. [2024-11-11 20:43:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8731 states, 7155 states have (on average 1.6125786163522013) internal successors, (11538), 7160 states have internal predecessors, (11538), 1555 states have call successors, (1555), 16 states have call predecessors, (1555), 20 states have return successors, (1750), 1554 states have call predecessors, (1750), 1554 states have call successors, (1750) [2024-11-11 20:43:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 14843 transitions. [2024-11-11 20:43:36,978 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 14843 transitions. Word has length 114 [2024-11-11 20:43:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 8731 states and 14843 transitions. [2024-11-11 20:43:36,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 14843 transitions. [2024-11-11 20:43:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:43:36,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:36,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:36,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:43:36,990 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:36,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1948475804, now seen corresponding path program 1 times [2024-11-11 20:43:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779209608] [2024-11-11 20:43:36,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:43:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:43:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:43:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:43:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:43:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779209608] [2024-11-11 20:43:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779209608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210390709] [2024-11-11 20:43:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:37,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:37,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:37,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:37,091 INFO L87 Difference]: Start difference. First operand 8731 states and 14843 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:38,038 INFO L93 Difference]: Finished difference Result 22646 states and 39275 transitions. [2024-11-11 20:43:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-11 20:43:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:38,087 INFO L225 Difference]: With dead ends: 22646 [2024-11-11 20:43:38,088 INFO L226 Difference]: Without dead ends: 15396 [2024-11-11 20:43:38,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:38,111 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 698 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:38,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 690 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:43:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15396 states. [2024-11-11 20:43:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15396 to 15324. [2024-11-11 20:43:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15324 states, 12545 states have (on average 1.6025508170585891) internal successors, (20104), 12550 states have internal predecessors, (20104), 2758 states have call successors, (2758), 16 states have call predecessors, (2758), 20 states have return successors, (3097), 2757 states have call predecessors, (3097), 2757 states have call successors, (3097) [2024-11-11 20:43:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15324 states to 15324 states and 25959 transitions. [2024-11-11 20:43:38,663 INFO L78 Accepts]: Start accepts. Automaton has 15324 states and 25959 transitions. Word has length 115 [2024-11-11 20:43:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 15324 states and 25959 transitions. [2024-11-11 20:43:38,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15324 states and 25959 transitions. [2024-11-11 20:43:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:43:38,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:38,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:38,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:43:38,678 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1783036109, now seen corresponding path program 1 times [2024-11-11 20:43:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458167678] [2024-11-11 20:43:38,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:43:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:43:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:43:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:43:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:43:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458167678] [2024-11-11 20:43:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458167678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:38,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031414417] [2024-11-11 20:43:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:38,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:38,761 INFO L87 Difference]: Start difference. First operand 15324 states and 25959 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:39,817 INFO L93 Difference]: Finished difference Result 40602 states and 70258 transitions. [2024-11-11 20:43:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:39,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-11 20:43:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:39,919 INFO L225 Difference]: With dead ends: 40602 [2024-11-11 20:43:39,919 INFO L226 Difference]: Without dead ends: 27366 [2024-11-11 20:43:39,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:39,958 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 696 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:39,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 647 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:43:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27366 states. [2024-11-11 20:43:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27366 to 27294. [2024-11-11 20:43:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27294 states, 22476 states have (on average 1.597793201637302) internal successors, (35912), 22481 states have internal predecessors, (35912), 4797 states have call successors, (4797), 16 states have call predecessors, (4797), 20 states have return successors, (5410), 4796 states have call predecessors, (5410), 4796 states have call successors, (5410) [2024-11-11 20:43:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27294 states to 27294 states and 46119 transitions. [2024-11-11 20:43:40,935 INFO L78 Accepts]: Start accepts. Automaton has 27294 states and 46119 transitions. Word has length 116 [2024-11-11 20:43:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 27294 states and 46119 transitions. [2024-11-11 20:43:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27294 states and 46119 transitions. [2024-11-11 20:43:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:43:40,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:40,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:43:40,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1541785178, now seen corresponding path program 1 times [2024-11-11 20:43:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986818230] [2024-11-11 20:43:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:43:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:43:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:43:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:43:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:43:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986818230] [2024-11-11 20:43:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986818230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544310934] [2024-11-11 20:43:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:41,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:41,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:41,131 INFO L87 Difference]: Start difference. First operand 27294 states and 46119 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:42,534 INFO L93 Difference]: Finished difference Result 74389 states and 127857 transitions. [2024-11-11 20:43:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-11 20:43:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:42,890 INFO L225 Difference]: With dead ends: 74389 [2024-11-11 20:43:42,890 INFO L226 Difference]: Without dead ends: 49915 [2024-11-11 20:43:42,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:42,956 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 694 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:42,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 652 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:43:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49915 states. [2024-11-11 20:43:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49915 to 49843. [2024-11-11 20:43:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49843 states, 41310 states have (on average 1.5916969256838538) internal successors, (65753), 41315 states have internal predecessors, (65753), 8512 states have call successors, (8512), 16 states have call predecessors, (8512), 20 states have return successors, (9657), 8511 states have call predecessors, (9657), 8511 states have call successors, (9657) [2024-11-11 20:43:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49843 states to 49843 states and 83922 transitions. [2024-11-11 20:43:44,784 INFO L78 Accepts]: Start accepts. Automaton has 49843 states and 83922 transitions. Word has length 117 [2024-11-11 20:43:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 49843 states and 83922 transitions. [2024-11-11 20:43:44,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 49843 states and 83922 transitions. [2024-11-11 20:43:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:43:44,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:44,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:43:44,814 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:44,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1856285709, now seen corresponding path program 1 times [2024-11-11 20:43:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213029773] [2024-11-11 20:43:44,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:43:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:43:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:43:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:43:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:43:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213029773] [2024-11-11 20:43:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213029773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:43:44,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808695434] [2024-11-11 20:43:44,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:44,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:43:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:44,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:43:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:43:44,921 INFO L87 Difference]: Start difference. First operand 49843 states and 83922 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:47,453 INFO L93 Difference]: Finished difference Result 92875 states and 159988 transitions. [2024-11-11 20:43:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:43:47,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2024-11-11 20:43:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:47,965 INFO L225 Difference]: With dead ends: 92875 [2024-11-11 20:43:47,965 INFO L226 Difference]: Without dead ends: 92759 [2024-11-11 20:43:47,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:43:47,999 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 689 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:48,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 679 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:43:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92759 states. [2024-11-11 20:43:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92759 to 92687. [2024-11-11 20:43:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92687 states, 77355 states have (on average 1.5841122099411802) internal successors, (122539), 77360 states have internal predecessors, (122539), 15311 states have call successors, (15311), 16 states have call predecessors, (15311), 20 states have return successors, (17502), 15310 states have call predecessors, (17502), 15310 states have call successors, (17502) [2024-11-11 20:43:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92687 states to 92687 states and 155352 transitions. [2024-11-11 20:43:50,924 INFO L78 Accepts]: Start accepts. Automaton has 92687 states and 155352 transitions. Word has length 118 [2024-11-11 20:43:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:50,924 INFO L471 AbstractCegarLoop]: Abstraction has 92687 states and 155352 transitions. [2024-11-11 20:43:50,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 92687 states and 155352 transitions. [2024-11-11 20:43:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:43:50,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:50,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:50,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:43:50,952 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:50,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -773662011, now seen corresponding path program 1 times [2024-11-11 20:43:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:50,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537163380] [2024-11-11 20:43:50,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:43:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:43:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:43:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:43:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:43:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:51,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537163380] [2024-11-11 20:43:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537163380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:43:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397092879] [2024-11-11 20:43:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:43:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:51,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:43:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:43:51,517 INFO L87 Difference]: Start difference. First operand 92687 states and 155352 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:43:54,264 INFO L93 Difference]: Finished difference Result 93023 states and 159116 transitions. [2024-11-11 20:43:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:43:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-11 20:43:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:43:54,724 INFO L225 Difference]: With dead ends: 93023 [2024-11-11 20:43:54,724 INFO L226 Difference]: Without dead ends: 92917 [2024-11-11 20:43:54,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:43:54,762 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1000 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:43:54,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 959 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:43:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92917 states. [2024-11-11 20:43:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92917 to 92795. [2024-11-11 20:43:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92795 states, 77443 states have (on average 1.5839649806954792) internal successors, (122667), 77448 states have internal predecessors, (122667), 15321 states have call successors, (15321), 24 states have call predecessors, (15321), 30 states have return successors, (17515), 15322 states have call predecessors, (17515), 15319 states have call successors, (17515) [2024-11-11 20:43:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92795 states to 92795 states and 155503 transitions. [2024-11-11 20:43:58,066 INFO L78 Accepts]: Start accepts. Automaton has 92795 states and 155503 transitions. Word has length 119 [2024-11-11 20:43:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:58,066 INFO L471 AbstractCegarLoop]: Abstraction has 92795 states and 155503 transitions. [2024-11-11 20:43:58,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:43:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 92795 states and 155503 transitions. [2024-11-11 20:43:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:43:58,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:58,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:43:58,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:43:58,088 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -850075122, now seen corresponding path program 1 times [2024-11-11 20:43:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:58,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235589608] [2024-11-11 20:43:58,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:43:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:43:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:43:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:43:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:43:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:43:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235589608] [2024-11-11 20:43:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235589608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:43:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:43:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 20:43:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594444296] [2024-11-11 20:43:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:43:58,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:43:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:43:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:43:58,684 INFO L87 Difference]: Start difference. First operand 92795 states and 155503 transitions. Second operand has 14 states, 12 states have (on average 6.666666666666667) internal successors, (80), 10 states have internal predecessors, (80), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-11 20:44:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:44:01,633 INFO L93 Difference]: Finished difference Result 93337 states and 159599 transitions. [2024-11-11 20:44:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 20:44:01,634 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.666666666666667) internal successors, (80), 10 states have internal predecessors, (80), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 120 [2024-11-11 20:44:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:44:01,994 INFO L225 Difference]: With dead ends: 93337 [2024-11-11 20:44:01,994 INFO L226 Difference]: Without dead ends: 92963 [2024-11-11 20:44:02,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 20:44:02,034 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1163 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:44:02,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1768 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:44:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92963 states. [2024-11-11 20:44:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92963 to 92832. [2024-11-11 20:44:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92832 states, 77472 states have (on average 1.5838883725733168) internal successors, (122707), 77480 states have internal predecessors, (122707), 15327 states have call successors, (15327), 25 states have call predecessors, (15327), 32 states have return successors, (17523), 15326 states have call predecessors, (17523), 15325 states have call successors, (17523) [2024-11-11 20:44:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92832 states to 92832 states and 155557 transitions. [2024-11-11 20:44:05,057 INFO L78 Accepts]: Start accepts. Automaton has 92832 states and 155557 transitions. Word has length 120 [2024-11-11 20:44:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:44:05,057 INFO L471 AbstractCegarLoop]: Abstraction has 92832 states and 155557 transitions. [2024-11-11 20:44:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.666666666666667) internal successors, (80), 10 states have internal predecessors, (80), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-11 20:44:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 92832 states and 155557 transitions. [2024-11-11 20:44:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:44:05,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:44:05,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:44:05,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 20:44:05,080 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:44:05,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:44:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1874175611, now seen corresponding path program 1 times [2024-11-11 20:44:05,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:44:05,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42902371] [2024-11-11 20:44:05,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:44:05,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:44:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:44:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:44:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:44:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:44:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:44:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:44:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:44:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:44:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:44:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:44:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:44:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 20:44:05,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:44:05,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42902371] [2024-11-11 20:44:05,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42902371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:44:05,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:44:05,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:44:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955497141] [2024-11-11 20:44:05,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:44:05,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:44:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:44:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:44:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:44:05,247 INFO L87 Difference]: Start difference. First operand 92832 states and 155557 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:44:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:44:08,917 INFO L93 Difference]: Finished difference Result 93409 states and 159681 transitions. [2024-11-11 20:44:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 20:44:08,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 123 [2024-11-11 20:44:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:44:09,241 INFO L225 Difference]: With dead ends: 93409 [2024-11-11 20:44:09,242 INFO L226 Difference]: Without dead ends: 93341 [2024-11-11 20:44:09,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-11 20:44:09,284 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1115 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:44:09,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1345 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:44:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93341 states. [2024-11-11 20:44:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93341 to 93095. [2024-11-11 20:44:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93095 states, 77685 states have (on average 1.583484585183755) internal successors, (123013), 77696 states have internal predecessors, (123013), 15352 states have call successors, (15352), 41 states have call predecessors, (15352), 57 states have return successors, (17563), 15357 states have call predecessors, (17563), 15348 states have call successors, (17563) [2024-11-11 20:44:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93095 states to 93095 states and 155928 transitions. [2024-11-11 20:44:12,498 INFO L78 Accepts]: Start accepts. Automaton has 93095 states and 155928 transitions. Word has length 123 [2024-11-11 20:44:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:44:12,498 INFO L471 AbstractCegarLoop]: Abstraction has 93095 states and 155928 transitions. [2024-11-11 20:44:12,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:44:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 93095 states and 155928 transitions. [2024-11-11 20:44:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:44:12,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:44:12,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:44:12,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 20:44:12,521 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:44:12,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:44:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1765914484, now seen corresponding path program 1 times [2024-11-11 20:44:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:44:12,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065984019] [2024-11-11 20:44:12,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:44:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:44:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:44:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:44:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:44:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:44:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:44:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:44:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:44:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:44:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:44:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:12,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:44:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:44:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:44:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 20:44:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:44:13,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065984019] [2024-11-11 20:44:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065984019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:44:13,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:44:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 20:44:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463517697] [2024-11-11 20:44:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:44:13,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:44:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:44:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:44:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:44:13,076 INFO L87 Difference]: Start difference. First operand 93095 states and 155928 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 9 states have internal predecessors, (87), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-11 20:44:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:44:16,105 INFO L93 Difference]: Finished difference Result 93551 states and 159879 transitions. [2024-11-11 20:44:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 20:44:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 9 states have internal predecessors, (87), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 124 [2024-11-11 20:44:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:44:16,385 INFO L225 Difference]: With dead ends: 93551 [2024-11-11 20:44:16,385 INFO L226 Difference]: Without dead ends: 93327 [2024-11-11 20:44:16,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-11-11 20:44:16,422 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1166 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:44:16,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1562 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:44:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93327 states.