./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6a2f1102c08ad072b808cfc472937f1cd1560bb61fc22de7fb77e42f10991bfd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:41:19,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:41:19,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:41:19,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:41:19,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:41:19,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:41:19,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:41:19,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:41:19,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:41:19,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:41:19,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:41:19,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:41:19,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:41:19,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:41:19,545 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:41:19,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:41:19,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:41:19,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:41:19,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:41:19,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:41:19,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:41:19,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:41:19,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:41:19,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:41:19,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:41:19,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:41:19,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:41:19,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:41:19,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:41:19,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:41:19,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:41:19,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:41:19,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:41:19,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:41:19,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:41:19,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:41:19,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:41:19,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:41:19,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:41:19,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:41:19,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:41:19,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:41:19,557 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-clean/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-clean/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 -> 6a2f1102c08ad072b808cfc472937f1cd1560bb61fc22de7fb77e42f10991bfd [2024-10-11 02:41:19,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:41:19,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:41:19,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:41:19,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:41:19,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:41:19,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c [2024-10-11 02:41:21,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:41:21,601 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:41:21,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c [2024-10-11 02:41:21,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/04f0bd82c/70c31e2c97ea48c5b78cd385889b2aae/FLAG0c5808889 [2024-10-11 02:41:21,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/04f0bd82c/70c31e2c97ea48c5b78cd385889b2aae [2024-10-11 02:41:21,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:41:21,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:41:21,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:41:21,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:41:21,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:41:21,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:41:21" (1/1) ... [2024-10-11 02:41:21,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bee219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:21, skipping insertion in model container [2024-10-11 02:41:21,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:41:21" (1/1) ... [2024-10-11 02:41:21,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:41:22,121 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c[31228,31241] [2024-10-11 02:41:22,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:41:22,311 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:41:22,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-10-11 02:41:22,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1128] [2024-10-11 02:41:22,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1288] [2024-10-11 02:41:22,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1326] [2024-10-11 02:41:22,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1335] [2024-10-11 02:41:22,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1355] [2024-10-11 02:41:22,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1751] [2024-10-11 02:41:22,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1768] [2024-10-11 02:41:22,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2165] [2024-10-11 02:41:22,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2531] [2024-10-11 02:41:22,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2827] [2024-10-11 02:41:22,382 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c[31228,31241] [2024-10-11 02:41:22,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:41:22,491 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:41:22,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22 WrapperNode [2024-10-11 02:41:22,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:41:22,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:41:22,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:41:22,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:41:22,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,587 INFO L138 Inliner]: procedures = 134, calls = 211, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1070 [2024-10-11 02:41:22,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:41:22,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:41:22,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:41:22,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:41:22,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,635 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-10-11 02:41:22,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:41:22,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:41:22,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:41:22,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:41:22,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (1/1) ... [2024-10-11 02:41:22,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:41:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:22,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:41:22,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:41:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:41:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:41:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:41:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:41:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:41:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:41:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:41:22,812 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:41:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:41:22,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:41:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:41:22,813 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:41:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:41:22,813 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:41:22,814 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:41:22,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:41:22,814 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:41:22,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:41:22,814 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:41:22,815 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:41:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:41:22,815 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:41:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-11 02:41:22,815 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-11 02:41:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:41:22,816 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:41:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:41:22,816 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:41:22,816 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:41:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:41:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:41:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:41:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:41:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:41:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:41:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:41:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:41:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:41:22,818 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:41:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:41:22,818 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:41:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:41:22,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:41:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:41:22,818 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:41:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:41:22,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:41:22,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:41:22,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:41:22,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:41:22,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:41:22,819 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:41:22,819 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:41:22,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:41:22,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:41:23,065 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:41:23,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:41:24,016 INFO L? ?]: Removed 497 outVars from TransFormulas that were not future-live. [2024-10-11 02:41:24,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:41:24,080 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:41:24,080 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:41:24,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:41:24 BoogieIcfgContainer [2024-10-11 02:41:24,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:41:24,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:41:24,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:41:24,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:41:24,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:41:21" (1/3) ... [2024-10-11 02:41:24,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417a76df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:41:24, skipping insertion in model container [2024-10-11 02:41:24,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:22" (2/3) ... [2024-10-11 02:41:24,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417a76df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:41:24, skipping insertion in model container [2024-10-11 02:41:24,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:41:24" (3/3) ... [2024-10-11 02:41:24,089 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product33.cil.c [2024-10-11 02:41:24,132 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:41:24,132 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:41:24,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:41:24,234 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;@4a5eb69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:41:24,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:41:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 354 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 270 states have internal predecessors, (415), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 02:41:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 02:41:24,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:24,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:24,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:24,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2127152086, now seen corresponding path program 1 times [2024-10-11 02:41:24,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:24,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166672954] [2024-10-11 02:41:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:24,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:41:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:41:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:41:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:41:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:41:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:41:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:41:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:41:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:41:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:41:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 02:41:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 02:41:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166672954] [2024-10-11 02:41:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166672954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200890982] [2024-10-11 02:41:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:25,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:25,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:41:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:25,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:41:25,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 02:41:25,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200890982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:25,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:41:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565420874] [2024-10-11 02:41:25,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:41:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:41:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:25,726 INFO L87 Difference]: Start difference. First operand has 354 states, 266 states have (on average 1.5601503759398496) internal successors, (415), 270 states have internal predecessors, (415), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:25,830 INFO L93 Difference]: Finished difference Result 559 states and 834 transitions. [2024-10-11 02:41:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:41:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 141 [2024-10-11 02:41:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:25,855 INFO L225 Difference]: With dead ends: 559 [2024-10-11 02:41:25,857 INFO L226 Difference]: Without dead ends: 351 [2024-10-11 02:41:25,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:25,866 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:25,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:41:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-11 02:41:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-10-11 02:41:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 264 states have (on average 1.5454545454545454) internal successors, (408), 267 states have internal predecessors, (408), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-11 02:41:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 531 transitions. [2024-10-11 02:41:25,928 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 531 transitions. Word has length 141 [2024-10-11 02:41:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:25,930 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 531 transitions. [2024-10-11 02:41:25,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 531 transitions. [2024-10-11 02:41:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 02:41:25,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:25,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:25,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:41:26,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:41:26,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:26,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1477666789, now seen corresponding path program 1 times [2024-10-11 02:41:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:26,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033587072] [2024-10-11 02:41:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:41:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:41:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:41:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:41:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:41:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:41:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:41:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:41:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:41:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:41:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:41:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 02:41:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033587072] [2024-10-11 02:41:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033587072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:26,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716997967] [2024-10-11 02:41:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:26,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:26,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:26,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:26,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:41:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:26,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:41:26,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 02:41:26,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716997967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:26,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:26,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:41:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597485844] [2024-10-11 02:41:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:26,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:41:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:41:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:26,915 INFO L87 Difference]: Start difference. First operand 351 states and 531 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:26,994 INFO L93 Difference]: Finished difference Result 555 states and 821 transitions. [2024-10-11 02:41:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:41:26,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2024-10-11 02:41:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:27,001 INFO L225 Difference]: With dead ends: 555 [2024-10-11 02:41:27,001 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 02:41:27,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:27,006 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:27,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1027 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:41:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 02:41:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-10-11 02:41:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 266 states have (on average 1.5413533834586466) internal successors, (410), 269 states have internal predecessors, (410), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-11 02:41:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2024-10-11 02:41:27,048 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 142 [2024-10-11 02:41:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2024-10-11 02:41:27,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2024-10-11 02:41:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 02:41:27,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:27,055 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:27,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:41:27,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:27,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash 49868154, now seen corresponding path program 1 times [2024-10-11 02:41:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:27,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142303340] [2024-10-11 02:41:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:41:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:41:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:41:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:41:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:41:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:41:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:41:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:41:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:41:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:41:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 02:41:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:41:27,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:27,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142303340] [2024-10-11 02:41:27,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142303340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:27,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351962793] [2024-10-11 02:41:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:27,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:27,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:27,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:41:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:27,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:41:27,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 02:41:27,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351962793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:27,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:27,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:41:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482622758] [2024-10-11 02:41:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:27,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:41:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:41:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:27,970 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:28,039 INFO L93 Difference]: Finished difference Result 740 states and 1132 transitions. [2024-10-11 02:41:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:41:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2024-10-11 02:41:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:28,043 INFO L225 Difference]: With dead ends: 740 [2024-10-11 02:41:28,043 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 02:41:28,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:28,046 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 109 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:28,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 994 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:41:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 02:41:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 404. [2024-10-11 02:41:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 306 states have (on average 1.5588235294117647) internal successors, (477), 309 states have internal predecessors, (477), 73 states have call successors, (73), 24 states have call predecessors, (73), 24 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 02:41:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 622 transitions. [2024-10-11 02:41:28,068 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 622 transitions. Word has length 149 [2024-10-11 02:41:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:28,069 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 622 transitions. [2024-10-11 02:41:28,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 622 transitions. [2024-10-11 02:41:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 02:41:28,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:28,072 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:28,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:41:28,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:28,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:28,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash 5229475, now seen corresponding path program 1 times [2024-10-11 02:41:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:28,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476715575] [2024-10-11 02:41:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:41:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:41:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:41:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:41:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:41:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:41:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:41:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:41:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:41:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 02:41:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:41:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:41:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476715575] [2024-10-11 02:41:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476715575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785836346] [2024-10-11 02:41:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:28,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:28,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:28,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:28,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:41:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:28,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:41:28,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 02:41:28,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785836346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:28,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:41:28,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951018554] [2024-10-11 02:41:28,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:41:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:28,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:41:28,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:28,979 INFO L87 Difference]: Start difference. First operand 404 states and 622 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:29,103 INFO L93 Difference]: Finished difference Result 803 states and 1238 transitions. [2024-10-11 02:41:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:41:29,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 150 [2024-10-11 02:41:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:29,107 INFO L225 Difference]: With dead ends: 803 [2024-10-11 02:41:29,107 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 02:41:29,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:29,110 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 2 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:29,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2013 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:41:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 02:41:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-10-11 02:41:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 307 states have (on average 1.5570032573289903) internal successors, (478), 311 states have internal predecessors, (478), 73 states have call successors, (73), 24 states have call predecessors, (73), 25 states have return successors, (74), 72 states have call predecessors, (74), 72 states have call successors, (74) [2024-10-11 02:41:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 625 transitions. [2024-10-11 02:41:29,129 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 625 transitions. Word has length 150 [2024-10-11 02:41:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:29,129 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 625 transitions. [2024-10-11 02:41:29,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 625 transitions. [2024-10-11 02:41:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 02:41:29,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:29,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:29,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:41:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:29,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 92685548, now seen corresponding path program 1 times [2024-10-11 02:41:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166609732] [2024-10-11 02:41:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:41:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:41:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:41:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:41:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:41:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:41:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:41:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:41:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:41:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:41:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:41:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:41:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:41:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:41:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:29,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166609732] [2024-10-11 02:41:29,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166609732] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:29,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076981917] [2024-10-11 02:41:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:29,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:29,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:29,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:29,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:41:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:29,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:41:29,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 02:41:30,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076981917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:30,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:30,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:41:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817061804] [2024-10-11 02:41:30,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:30,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:41:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:30,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:41:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:41:30,057 INFO L87 Difference]: Start difference. First operand 406 states and 625 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:30,161 INFO L93 Difference]: Finished difference Result 805 states and 1243 transitions. [2024-10-11 02:41:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:41:30,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2024-10-11 02:41:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:30,165 INFO L225 Difference]: With dead ends: 805 [2024-10-11 02:41:30,165 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 02:41:30,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:41:30,167 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 2 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:30,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1999 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:41:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 02:41:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2024-10-11 02:41:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 308 states have (on average 1.5551948051948052) internal successors, (479), 313 states have internal predecessors, (479), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2024-10-11 02:41:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 631 transitions. [2024-10-11 02:41:30,185 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 631 transitions. Word has length 151 [2024-10-11 02:41:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:30,185 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 631 transitions. [2024-10-11 02:41:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 631 transitions. [2024-10-11 02:41:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 02:41:30,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:30,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:30,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 02:41:30,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:30,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:30,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1833158924, now seen corresponding path program 1 times [2024-10-11 02:41:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317396422] [2024-10-11 02:41:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:41:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:41:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:41:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:41:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:41:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:41:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:41:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:41:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:41:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:41:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:41:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 02:41:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:41:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317396422] [2024-10-11 02:41:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317396422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:41:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833013481] [2024-10-11 02:41:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:30,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:41:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:41:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:30,641 INFO L87 Difference]: Start difference. First operand 408 states and 631 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:32,964 INFO L93 Difference]: Finished difference Result 985 states and 1538 transitions. [2024-10-11 02:41:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:41:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2024-10-11 02:41:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:32,975 INFO L225 Difference]: With dead ends: 985 [2024-10-11 02:41:32,976 INFO L226 Difference]: Without dead ends: 596 [2024-10-11 02:41:32,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:41:32,978 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1222 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2895 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:32,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1016 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2895 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:41:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-11 02:41:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 408. [2024-10-11 02:41:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 308 states have (on average 1.5551948051948052) internal successors, (479), 313 states have internal predecessors, (479), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (78), 72 states have call predecessors, (78), 72 states have call successors, (78) [2024-10-11 02:41:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 630 transitions. [2024-10-11 02:41:33,028 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 630 transitions. Word has length 152 [2024-10-11 02:41:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:33,029 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 630 transitions. [2024-10-11 02:41:33,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 630 transitions. [2024-10-11 02:41:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 02:41:33,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:33,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:33,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:41:33,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:33,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash -251128393, now seen corresponding path program 2 times [2024-10-11 02:41:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920218015] [2024-10-11 02:41:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:41:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:41:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:41:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:41:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:41:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:41:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:41:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:41:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:41:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:41:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 02:41:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 02:41:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-11 02:41:33,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:33,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920218015] [2024-10-11 02:41:33,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920218015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:33,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:33,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:41:33,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35720208] [2024-10-11 02:41:33,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:33,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:41:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:41:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:33,339 INFO L87 Difference]: Start difference. First operand 408 states and 630 transitions. Second operand has 9 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:35,652 INFO L93 Difference]: Finished difference Result 987 states and 1541 transitions. [2024-10-11 02:41:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:41:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2024-10-11 02:41:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:35,657 INFO L225 Difference]: With dead ends: 987 [2024-10-11 02:41:35,657 INFO L226 Difference]: Without dead ends: 598 [2024-10-11 02:41:35,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:41:35,659 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1307 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:35,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1016 Invalid, 3242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2763 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:41:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-11 02:41:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 410. [2024-10-11 02:41:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 315 states have internal predecessors, (480), 73 states have call successors, (73), 24 states have call predecessors, (73), 27 states have return successors, (80), 72 states have call predecessors, (80), 72 states have call successors, (80) [2024-10-11 02:41:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 633 transitions. [2024-10-11 02:41:35,702 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 633 transitions. Word has length 153 [2024-10-11 02:41:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:35,703 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 633 transitions. [2024-10-11 02:41:35,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 02:41:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 633 transitions. [2024-10-11 02:41:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 02:41:35,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:35,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:35,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:41:35,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 876902919, now seen corresponding path program 1 times [2024-10-11 02:41:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128835047] [2024-10-11 02:41:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:41:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:41:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:41:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:41:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:41:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:41:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:41:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:41:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:41:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:41:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:41:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:41:35,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128835047] [2024-10-11 02:41:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128835047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:41:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49266261] [2024-10-11 02:41:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:35,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:41:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:35,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:41:35,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:35,959 INFO L87 Difference]: Start difference. First operand 410 states and 633 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (20), 6 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 02:41:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:38,841 INFO L93 Difference]: Finished difference Result 985 states and 1536 transitions. [2024-10-11 02:41:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:41:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (20), 6 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 154 [2024-10-11 02:41:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:38,849 INFO L225 Difference]: With dead ends: 985 [2024-10-11 02:41:38,849 INFO L226 Difference]: Without dead ends: 598 [2024-10-11 02:41:38,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:41:38,852 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1330 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:38,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1409 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:41:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-11 02:41:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 410. [2024-10-11 02:41:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 315 states have internal predecessors, (480), 73 states have call successors, (73), 24 states have call predecessors, (73), 27 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2024-10-11 02:41:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 632 transitions. [2024-10-11 02:41:38,884 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 632 transitions. Word has length 154 [2024-10-11 02:41:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 632 transitions. [2024-10-11 02:41:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (20), 6 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 02:41:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 632 transitions. [2024-10-11 02:41:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 02:41:38,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:38,888 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:41:38,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1425161559, now seen corresponding path program 2 times [2024-10-11 02:41:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090756670] [2024-10-11 02:41:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:38,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:41:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:41:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:41:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:41:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:41:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:41:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:41:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:41:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:41:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 02:41:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 02:41:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 02:41:39,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090756670] [2024-10-11 02:41:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090756670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:39,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:39,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:41:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120515979] [2024-10-11 02:41:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:39,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:41:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:39,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:41:39,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:39,159 INFO L87 Difference]: Start difference. First operand 410 states and 632 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (20), 6 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 02:41:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:41,644 INFO L93 Difference]: Finished difference Result 987 states and 1542 transitions. [2024-10-11 02:41:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:41:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (20), 6 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 155 [2024-10-11 02:41:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:41,651 INFO L225 Difference]: With dead ends: 987 [2024-10-11 02:41:41,651 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 02:41:41,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:41:41,654 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1372 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4162 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 4162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:41,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 1410 Invalid, 4688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 4162 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 02:41:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 02:41:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 412. [2024-10-11 02:41:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 310 states have (on average 1.5516129032258064) internal successors, (481), 317 states have internal predecessors, (481), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (84), 72 states have call predecessors, (84), 72 states have call successors, (84) [2024-10-11 02:41:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 638 transitions. [2024-10-11 02:41:41,705 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 638 transitions. Word has length 155 [2024-10-11 02:41:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:41,705 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 638 transitions. [2024-10-11 02:41:41,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (20), 6 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 02:41:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 638 transitions. [2024-10-11 02:41:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 02:41:41,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:41,709 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:41,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:41:41,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:41,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:41,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1541159458, now seen corresponding path program 1 times [2024-10-11 02:41:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:41,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701331210] [2024-10-11 02:41:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:41,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:41:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:41:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:41:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:41:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:41:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:41:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:41:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:41:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:41:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:41:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 02:41:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 02:41:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701331210] [2024-10-11 02:41:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701331210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:41,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732749710] [2024-10-11 02:41:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:42,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:42,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:41:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:41:42,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:42,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:41:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732749710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:41:42,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:41:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-11 02:41:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571122792] [2024-10-11 02:41:42,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:41:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:41:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:41:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:41:42,470 INFO L87 Difference]: Start difference. First operand 412 states and 638 transitions. Second operand has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-11 02:41:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:45,166 INFO L93 Difference]: Finished difference Result 1336 states and 2188 transitions. [2024-10-11 02:41:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:41:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 156 [2024-10-11 02:41:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:45,172 INFO L225 Difference]: With dead ends: 1336 [2024-10-11 02:41:45,172 INFO L226 Difference]: Without dead ends: 950 [2024-10-11 02:41:45,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:41:45,175 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 2458 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 4421 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 5241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 4421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:45,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2475 Valid, 1578 Invalid, 5241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [820 Valid, 4421 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:41:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-10-11 02:41:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 747. [2024-10-11 02:41:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 581 states have (on average 1.6075731497418244) internal successors, (934), 588 states have internal predecessors, (934), 137 states have call successors, (137), 24 states have call predecessors, (137), 28 states have return successors, (158), 136 states have call predecessors, (158), 136 states have call successors, (158) [2024-10-11 02:41:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1229 transitions. [2024-10-11 02:41:45,225 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1229 transitions. Word has length 156 [2024-10-11 02:41:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:45,225 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1229 transitions. [2024-10-11 02:41:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-11 02:41:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1229 transitions. [2024-10-11 02:41:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 02:41:45,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:45,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:45,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 02:41:45,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:41:45,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:45,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash -494214905, now seen corresponding path program 1 times [2024-10-11 02:41:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622752357] [2024-10-11 02:41:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:41:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:41:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:41:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:41:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:41:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:41:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:41:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:41:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:41:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:41:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 02:41:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622752357] [2024-10-11 02:41:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622752357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709362545] [2024-10-11 02:41:45,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:45,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:45,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:45,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:45,567 INFO L87 Difference]: Start difference. First operand 747 states and 1229 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:46,948 INFO L93 Difference]: Finished difference Result 1931 states and 3247 transitions. [2024-10-11 02:41:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:46,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-10-11 02:41:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:46,955 INFO L225 Difference]: With dead ends: 1931 [2024-10-11 02:41:46,956 INFO L226 Difference]: Without dead ends: 1252 [2024-10-11 02:41:46,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:46,959 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1321 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:46,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 773 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:41:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-10-11 02:41:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1059. [2024-10-11 02:41:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 829 states have (on average 1.6236429433051869) internal successors, (1346), 836 states have internal predecessors, (1346), 201 states have call successors, (201), 24 states have call predecessors, (201), 28 states have return successors, (232), 200 states have call predecessors, (232), 200 states have call successors, (232) [2024-10-11 02:41:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1779 transitions. [2024-10-11 02:41:47,021 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1779 transitions. Word has length 160 [2024-10-11 02:41:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:47,021 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1779 transitions. [2024-10-11 02:41:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1779 transitions. [2024-10-11 02:41:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 02:41:47,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:47,028 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:47,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:41:47,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1226164733, now seen corresponding path program 1 times [2024-10-11 02:41:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594275711] [2024-10-11 02:41:47,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:41:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:41:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:41:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:41:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:41:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:41:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:41:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:41:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:41:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 02:41:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 02:41:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:47,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:47,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594275711] [2024-10-11 02:41:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594275711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:47,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922916726] [2024-10-11 02:41:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:47,220 INFO L87 Difference]: Start difference. First operand 1059 states and 1779 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:48,695 INFO L93 Difference]: Finished difference Result 2700 states and 4595 transitions. [2024-10-11 02:41:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:48,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2024-10-11 02:41:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:48,706 INFO L225 Difference]: With dead ends: 2700 [2024-10-11 02:41:48,706 INFO L226 Difference]: Without dead ends: 1759 [2024-10-11 02:41:48,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:48,711 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1371 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:48,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 740 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:41:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-10-11 02:41:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1566. [2024-10-11 02:41:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1241 states have (on average 1.6325543916196616) internal successors, (2026), 1248 states have internal predecessors, (2026), 296 states have call successors, (296), 24 states have call predecessors, (296), 28 states have return successors, (327), 295 states have call predecessors, (327), 295 states have call successors, (327) [2024-10-11 02:41:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2649 transitions. [2024-10-11 02:41:48,804 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2649 transitions. Word has length 161 [2024-10-11 02:41:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:48,804 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2649 transitions. [2024-10-11 02:41:48,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2649 transitions. [2024-10-11 02:41:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 02:41:48,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:48,814 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:48,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:41:48,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:48,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1254375993, now seen corresponding path program 1 times [2024-10-11 02:41:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869981220] [2024-10-11 02:41:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:41:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:41:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:41:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:41:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:41:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:41:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:41:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:41:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:41:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 02:41:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 02:41:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869981220] [2024-10-11 02:41:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869981220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:48,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861966080] [2024-10-11 02:41:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:48,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:48,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:48,972 INFO L87 Difference]: Start difference. First operand 1566 states and 2649 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:50,565 INFO L93 Difference]: Finished difference Result 3846 states and 6620 transitions. [2024-10-11 02:41:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2024-10-11 02:41:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:50,579 INFO L225 Difference]: With dead ends: 3846 [2024-10-11 02:41:50,580 INFO L226 Difference]: Without dead ends: 2526 [2024-10-11 02:41:50,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:50,585 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1340 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:50,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 738 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:41:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-10-11 02:41:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2333. [2024-10-11 02:41:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 1885 states have (on average 1.639787798408488) internal successors, (3091), 1892 states have internal predecessors, (3091), 419 states have call successors, (419), 24 states have call predecessors, (419), 28 states have return successors, (466), 418 states have call predecessors, (466), 418 states have call successors, (466) [2024-10-11 02:41:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3976 transitions. [2024-10-11 02:41:50,694 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3976 transitions. Word has length 162 [2024-10-11 02:41:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:50,694 INFO L471 AbstractCegarLoop]: Abstraction has 2333 states and 3976 transitions. [2024-10-11 02:41:50,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3976 transitions. [2024-10-11 02:41:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 02:41:50,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:50,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:41:50,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:50,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 5157116, now seen corresponding path program 1 times [2024-10-11 02:41:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224100776] [2024-10-11 02:41:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:41:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:41:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:41:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:41:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:41:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:41:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:41:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:41:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:41:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 02:41:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 02:41:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224100776] [2024-10-11 02:41:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224100776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064868852] [2024-10-11 02:41:50,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:50,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:50,883 INFO L87 Difference]: Start difference. First operand 2333 states and 3976 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:52,265 INFO L93 Difference]: Finished difference Result 5628 states and 9778 transitions. [2024-10-11 02:41:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-10-11 02:41:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:52,288 INFO L225 Difference]: With dead ends: 5628 [2024-10-11 02:41:52,288 INFO L226 Difference]: Without dead ends: 3750 [2024-10-11 02:41:52,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:52,322 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1330 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:52,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 738 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:41:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3750 states. [2024-10-11 02:41:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3750 to 3557. [2024-10-11 02:41:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 2930 states have (on average 1.6447098976109216) internal successors, (4819), 2937 states have internal predecessors, (4819), 598 states have call successors, (598), 24 states have call predecessors, (598), 28 states have return successors, (671), 597 states have call predecessors, (671), 597 states have call successors, (671) [2024-10-11 02:41:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 6088 transitions. [2024-10-11 02:41:52,489 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 6088 transitions. Word has length 163 [2024-10-11 02:41:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:52,490 INFO L471 AbstractCegarLoop]: Abstraction has 3557 states and 6088 transitions. [2024-10-11 02:41:52,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 6088 transitions. [2024-10-11 02:41:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 02:41:52,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:52,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:41:52,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1828039165, now seen corresponding path program 1 times [2024-10-11 02:41:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582221459] [2024-10-11 02:41:52,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:41:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:41:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:41:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:41:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:41:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:41:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:41:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:41:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:41:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 02:41:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 02:41:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582221459] [2024-10-11 02:41:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582221459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975674736] [2024-10-11 02:41:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:52,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:52,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:52,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:52,642 INFO L87 Difference]: Start difference. First operand 3557 states and 6088 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:54,259 INFO L93 Difference]: Finished difference Result 8607 states and 15018 transitions. [2024-10-11 02:41:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 164 [2024-10-11 02:41:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:54,293 INFO L225 Difference]: With dead ends: 8607 [2024-10-11 02:41:54,293 INFO L226 Difference]: Without dead ends: 5808 [2024-10-11 02:41:54,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:54,308 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1385 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:54,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 763 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:41:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2024-10-11 02:41:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 5615. [2024-10-11 02:41:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 4612 states have (on average 1.6352992194275802) internal successors, (7542), 4619 states have internal predecessors, (7542), 974 states have call successors, (974), 24 states have call predecessors, (974), 28 states have return successors, (1091), 973 states have call predecessors, (1091), 973 states have call successors, (1091) [2024-10-11 02:41:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 9607 transitions. [2024-10-11 02:41:54,643 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 9607 transitions. Word has length 164 [2024-10-11 02:41:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:54,643 INFO L471 AbstractCegarLoop]: Abstraction has 5615 states and 9607 transitions. [2024-10-11 02:41:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 9607 transitions. [2024-10-11 02:41:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 02:41:54,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:54,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:41:54,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash -207043272, now seen corresponding path program 1 times [2024-10-11 02:41:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885523542] [2024-10-11 02:41:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:41:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:41:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:41:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:41:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:41:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:41:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:41:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:41:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:41:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 02:41:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 02:41:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885523542] [2024-10-11 02:41:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885523542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:54,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471313933] [2024-10-11 02:41:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:54,787 INFO L87 Difference]: Start difference. First operand 5615 states and 9607 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:56,351 INFO L93 Difference]: Finished difference Result 13968 states and 24375 transitions. [2024-10-11 02:41:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:56,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2024-10-11 02:41:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:56,401 INFO L225 Difference]: With dead ends: 13968 [2024-10-11 02:41:56,402 INFO L226 Difference]: Without dead ends: 9497 [2024-10-11 02:41:56,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:56,419 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 1347 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:56,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 751 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:41:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9497 states. [2024-10-11 02:41:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9497 to 9304. [2024-10-11 02:41:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9304 states, 7695 states have (on average 1.6337881741390514) internal successors, (12572), 7702 states have internal predecessors, (12572), 1580 states have call successors, (1580), 24 states have call predecessors, (1580), 28 states have return successors, (1775), 1579 states have call predecessors, (1775), 1579 states have call successors, (1775) [2024-10-11 02:41:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 15927 transitions. [2024-10-11 02:41:56,879 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 15927 transitions. Word has length 165 [2024-10-11 02:41:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:56,881 INFO L471 AbstractCegarLoop]: Abstraction has 9304 states and 15927 transitions. [2024-10-11 02:41:56,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 15927 transitions. [2024-10-11 02:41:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 02:41:56,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:56,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:56,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:41:56,923 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:56,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2071175985, now seen corresponding path program 1 times [2024-10-11 02:41:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533046104] [2024-10-11 02:41:56,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:41:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:41:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:41:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:41:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:41:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:41:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:41:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:41:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:41:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 02:41:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 02:41:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533046104] [2024-10-11 02:41:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533046104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939684149] [2024-10-11 02:41:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:57,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:57,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:57,060 INFO L87 Difference]: Start difference. First operand 9304 states and 15927 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:58,742 INFO L93 Difference]: Finished difference Result 24160 states and 42139 transitions. [2024-10-11 02:41:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:58,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2024-10-11 02:41:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:58,812 INFO L225 Difference]: With dead ends: 24160 [2024-10-11 02:41:58,812 INFO L226 Difference]: Without dead ends: 16457 [2024-10-11 02:41:58,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:58,848 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1442 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:58,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 768 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:41:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16457 states. [2024-10-11 02:41:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16457 to 16264. [2024-10-11 02:41:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16264 states, 13452 states have (on average 1.6254088611358906) internal successors, (21865), 13459 states have internal predecessors, (21865), 2783 states have call successors, (2783), 24 states have call predecessors, (2783), 28 states have return successors, (3122), 2782 states have call predecessors, (3122), 2782 states have call successors, (3122) [2024-10-11 02:41:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 27770 transitions. [2024-10-11 02:41:59,674 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 27770 transitions. Word has length 166 [2024-10-11 02:41:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 16264 states and 27770 transitions. [2024-10-11 02:41:59,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:41:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 27770 transitions. [2024-10-11 02:41:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 02:41:59,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:59,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:41:59,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:59,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash 36122391, now seen corresponding path program 1 times [2024-10-11 02:41:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387396097] [2024-10-11 02:41:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:41:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:41:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:41:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:41:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:41:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:41:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:41:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:41:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:41:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 02:41:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 02:41:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:41:59,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:59,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387396097] [2024-10-11 02:41:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387396097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:59,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677543855] [2024-10-11 02:41:59,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:59,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:59,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:59,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:59,846 INFO L87 Difference]: Start difference. First operand 16264 states and 27770 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:42:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:02,236 INFO L93 Difference]: Finished difference Result 43135 states and 75151 transitions. [2024-10-11 02:42:02,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:02,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 167 [2024-10-11 02:42:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:02,376 INFO L225 Difference]: With dead ends: 43135 [2024-10-11 02:42:02,377 INFO L226 Difference]: Without dead ends: 29120 [2024-10-11 02:42:02,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:02,434 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1412 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:02,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 742 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:42:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2024-10-11 02:42:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 28927. [2024-10-11 02:42:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28927 states, 24076 states have (on average 1.6219887024422661) internal successors, (39051), 24083 states have internal predecessors, (39051), 4822 states have call successors, (4822), 24 states have call predecessors, (4822), 28 states have return successors, (5435), 4821 states have call predecessors, (5435), 4821 states have call successors, (5435) [2024-10-11 02:42:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28927 states to 28927 states and 49308 transitions. [2024-10-11 02:42:03,995 INFO L78 Accepts]: Start accepts. Automaton has 28927 states and 49308 transitions. Word has length 167 [2024-10-11 02:42:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:03,996 INFO L471 AbstractCegarLoop]: Abstraction has 28927 states and 49308 transitions. [2024-10-11 02:42:03,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:42:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 28927 states and 49308 transitions. [2024-10-11 02:42:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 02:42:04,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:04,073 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:42:04,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:42:04,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:04,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash 748691117, now seen corresponding path program 1 times [2024-10-11 02:42:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:04,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098039031] [2024-10-11 02:42:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:42:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:42:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:42:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:42:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:42:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:42:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:42:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:42:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 02:42:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:42:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 02:42:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 02:42:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:42:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:42:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098039031] [2024-10-11 02:42:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098039031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75866782] [2024-10-11 02:42:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:04,471 INFO L87 Difference]: Start difference. First operand 28927 states and 49308 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:42:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:07,317 INFO L93 Difference]: Finished difference Result 78907 states and 136710 transitions. [2024-10-11 02:42:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2024-10-11 02:42:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:07,588 INFO L225 Difference]: With dead ends: 78907 [2024-10-11 02:42:07,588 INFO L226 Difference]: Without dead ends: 53008 [2024-10-11 02:42:07,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:07,674 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1364 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:07,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 740 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:42:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53008 states. [2024-10-11 02:42:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53008 to 52815. [2024-10-11 02:42:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52815 states, 44249 states have (on average 1.6172342877805148) internal successors, (71561), 44256 states have internal predecessors, (71561), 8537 states have call successors, (8537), 24 states have call predecessors, (8537), 28 states have return successors, (9682), 8536 states have call predecessors, (9682), 8536 states have call successors, (9682) [2024-10-11 02:42:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52815 states to 52815 states and 89780 transitions. [2024-10-11 02:42:10,028 INFO L78 Accepts]: Start accepts. Automaton has 52815 states and 89780 transitions. Word has length 168 [2024-10-11 02:42:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:10,029 INFO L471 AbstractCegarLoop]: Abstraction has 52815 states and 89780 transitions. [2024-10-11 02:42:10,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:42:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 52815 states and 89780 transitions. [2024-10-11 02:42:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 02:42:10,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:10,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:42:10,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:42:10,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:10,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash 872648567, now seen corresponding path program 1 times [2024-10-11 02:42:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490200078] [2024-10-11 02:42:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:42:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:42:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:42:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:42:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:42:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:42:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:42:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:42:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:42:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:42:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 02:42:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 02:42:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:42:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:42:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490200078] [2024-10-11 02:42:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490200078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040165189] [2024-10-11 02:42:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:10,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:10,789 INFO L87 Difference]: Start difference. First operand 52815 states and 89780 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:42:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:14,181 INFO L93 Difference]: Finished difference Result 98682 states and 171415 transitions. [2024-10-11 02:42:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2024-10-11 02:42:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:14,596 INFO L225 Difference]: With dead ends: 98682 [2024-10-11 02:42:14,596 INFO L226 Difference]: Without dead ends: 98480 [2024-10-11 02:42:14,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:14,649 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 1414 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:14,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 754 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:42:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98480 states. [2024-10-11 02:42:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98480 to 98287. [2024-10-11 02:42:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98287 states, 82922 states have (on average 1.6110320542196281) internal successors, (133590), 82929 states have internal predecessors, (133590), 15336 states have call successors, (15336), 24 states have call predecessors, (15336), 28 states have return successors, (17527), 15335 states have call predecessors, (17527), 15335 states have call successors, (17527) [2024-10-11 02:42:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98287 states to 98287 states and 166453 transitions. [2024-10-11 02:42:18,444 INFO L78 Accepts]: Start accepts. Automaton has 98287 states and 166453 transitions. Word has length 169 [2024-10-11 02:42:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:18,445 INFO L471 AbstractCegarLoop]: Abstraction has 98287 states and 166453 transitions. [2024-10-11 02:42:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:42:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98287 states and 166453 transitions. [2024-10-11 02:42:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 02:42:18,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:18,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:42:18,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:42:18,616 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1753007794, now seen corresponding path program 1 times [2024-10-11 02:42:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495836660] [2024-10-11 02:42:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:42:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:42:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:42:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:42:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:42:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:42:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:42:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:42:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:42:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:42:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 02:42:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 02:42:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:42:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-11 02:42:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495836660] [2024-10-11 02:42:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495836660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:42:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185465936] [2024-10-11 02:42:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:42:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:42:19,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:42:19,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:42:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:20,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 02:42:20,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:42:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:42:20,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:42:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 02:42:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185465936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:42:20,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:42:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 32 [2024-10-11 02:42:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392912670] [2024-10-11 02:42:20,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:42:20,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 02:42:20,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 02:42:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:42:20,612 INFO L87 Difference]: Start difference. First operand 98287 states and 166453 transitions. Second operand has 32 states, 30 states have (on average 8.2) internal successors, (246), 24 states have internal predecessors, (246), 9 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (46), 11 states have call predecessors, (46), 9 states have call successors, (46)