./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_spec1_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product30.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c07a23e40b849b33d08a88f08826cd6b68b33a2f2aee4edabb68f594c2a0aef6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:46:42,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:46:42,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:46:42,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:46:42,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:46:42,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:46:42,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:46:42,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:46:42,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:46:42,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:46:42,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:46:42,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:46:42,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:46:42,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:46:42,607 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:46:42,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:46:42,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:46:42,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:46:42,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:46:42,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:46:42,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:46:42,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:46:42,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:46:42,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:46:42,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:46:42,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:46:42,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:46:42,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:46:42,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:46:42,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:46:42,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:46:42,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:46:42,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:46:42,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:46:42,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:46:42,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:46:42,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:46:42,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:46:42,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:46:42,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:46:42,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:46:42,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:46:42,622 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c07a23e40b849b33d08a88f08826cd6b68b33a2f2aee4edabb68f594c2a0aef6 [2024-10-24 00:46:42,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:46:42,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:46:42,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:46:42,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:46:42,912 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:46:42,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product30.cil.c [2024-10-24 00:46:44,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:46:44,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:46:44,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product30.cil.c [2024-10-24 00:46:44,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8230f1df/5f22e90bff9d4d368c585d5ca8f5e5e5/FLAG8314f7356 [2024-10-24 00:46:44,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8230f1df/5f22e90bff9d4d368c585d5ca8f5e5e5 [2024-10-24 00:46:44,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:46:44,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:46:44,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:46:44,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:46:44,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:46:44,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:46:44" (1/1) ... [2024-10-24 00:46:44,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139d2c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:44, skipping insertion in model container [2024-10-24 00:46:44,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:46:44" (1/1) ... [2024-10-24 00:46:44,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:46:45,284 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_spec1_product30.cil.c[58327,58340] [2024-10-24 00:46:45,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:46:45,327 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:46:45,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2024-10-24 00:46:45,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [208] [2024-10-24 00:46:45,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [238] [2024-10-24 00:46:45,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] [2024-10-24 00:46:45,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [906] [2024-10-24 00:46:45,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1978] [2024-10-24 00:46:45,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2337] [2024-10-24 00:46:45,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2734] [2024-10-24 00:46:45,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2743] [2024-10-24 00:46:45,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2778] [2024-10-24 00:46:45,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2994] [2024-10-24 00:46:45,441 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_spec1_product30.cil.c[58327,58340] [2024-10-24 00:46:45,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:46:45,487 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:46:45,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45 WrapperNode [2024-10-24 00:46:45,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:46:45,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:46:45,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:46:45,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:46:45,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,571 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 60, calls inlined = 50, statements flattened = 911 [2024-10-24 00:46:45,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:46:45,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:46:45,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:46:45,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:46:45,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,626 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-24 00:46:45,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:46:45,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:46:45,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:46:45,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:46:45,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (1/1) ... [2024-10-24 00:46:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:46:45,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:45,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:46:45,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:46:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:46:45,839 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:46:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:46:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:46:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:46:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:46:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:46:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:46:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:46:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:46:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:46:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:46:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:46:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:46:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:46:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:46:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:46:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:46:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:46:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:46:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:46:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:46:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:46:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:46:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:46:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:46:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:46:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:46:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:46:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:46:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:46:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:46:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:46:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:46:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:46:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:46:45,843 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:46:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:46:45,843 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:46:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:46:45,843 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:46:45,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:46:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:46:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:46:45,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:46:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:46:45,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:46:45,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:46:45,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:46:45,872 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:46:45,872 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:46:45,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:46:45,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:46:46,096 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:46:46,101 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:46:47,016 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2024-10-24 00:46:47,017 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:46:47,116 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:46:47,117 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:46:47,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:46:47 BoogieIcfgContainer [2024-10-24 00:46:47,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:46:47,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:46:47,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:46:47,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:46:47,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:46:44" (1/3) ... [2024-10-24 00:46:47,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5e4e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:46:47, skipping insertion in model container [2024-10-24 00:46:47,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:46:45" (2/3) ... [2024-10-24 00:46:47,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5e4e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:46:47, skipping insertion in model container [2024-10-24 00:46:47,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:46:47" (3/3) ... [2024-10-24 00:46:47,128 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product30.cil.c [2024-10-24 00:46:47,146 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:46:47,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:46:47,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:46:47,242 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;@55fdd291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:46:47,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:46:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 00:46:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:46:47,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:47,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:47,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:47,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -392236607, now seen corresponding path program 1 times [2024-10-24 00:46:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652586038] [2024-10-24 00:46:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:46:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:46:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:46:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:46:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:46:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:46:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:46:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:46:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652586038] [2024-10-24 00:46:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652586038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:48,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137680391] [2024-10-24 00:46:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:48,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:48,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:48,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:48,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:46:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:48,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:46:48,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:46:48,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137680391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:48,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:46:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502760597] [2024-10-24 00:46:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:48,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:46:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:46:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:48,584 INFO L87 Difference]: Start difference. First operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:48,696 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2024-10-24 00:46:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:46:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-24 00:46:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:48,714 INFO L225 Difference]: With dead ends: 495 [2024-10-24 00:46:48,715 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 00:46:48,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 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-24 00:46:48,726 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:48,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:46:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 00:46:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-24 00:46:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 240 states have (on average 1.5583333333333333) internal successors, (374), 243 states have internal predecessors, (374), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 00:46:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2024-10-24 00:46:48,813 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 95 [2024-10-24 00:46:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:48,817 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2024-10-24 00:46:48,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2024-10-24 00:46:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:46:48,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:48,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-10-24 00:46:48,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:46:49,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:46:49,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 122970567, now seen corresponding path program 1 times [2024-10-24 00:46:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:49,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737352123] [2024-10-24 00:46:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:46:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:46:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:46:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:46:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:46:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:46:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:46:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737352123] [2024-10-24 00:46:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737352123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861782994] [2024-10-24 00:46:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:49,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:49,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:49,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:46:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:49,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:46:49,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:46:49,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861782994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:49,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:46:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185683468] [2024-10-24 00:46:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:46:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:46:49,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:49,752 INFO L87 Difference]: Start difference. First operand 317 states and 479 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:49,839 INFO L93 Difference]: Finished difference Result 491 states and 724 transitions. [2024-10-24 00:46:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:46:49,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-24 00:46:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:49,845 INFO L225 Difference]: With dead ends: 491 [2024-10-24 00:46:49,846 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 00:46:49,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 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-24 00:46:49,849 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:49,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 933 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:46:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 00:46:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-24 00:46:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 245 states have internal predecessors, (376), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 00:46:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 481 transitions. [2024-10-24 00:46:49,872 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 481 transitions. Word has length 96 [2024-10-24 00:46:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:49,874 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 481 transitions. [2024-10-24 00:46:49,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 481 transitions. [2024-10-24 00:46:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:46:49,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:49,880 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-10-24 00:46:49,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 00:46:50,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:46:50,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:50,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1704534011, now seen corresponding path program 1 times [2024-10-24 00:46:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:50,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221993585] [2024-10-24 00:46:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:46:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:46:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:46:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:46:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:46:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:46:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:46:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:50,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:50,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221993585] [2024-10-24 00:46:50,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221993585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:50,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401216091] [2024-10-24 00:46:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:50,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:50,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:50,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:50,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:46:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:46:50,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:46:50,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401216091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:50,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:46:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536591867] [2024-10-24 00:46:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:50,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:46:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:46:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:50,703 INFO L87 Difference]: Start difference. First operand 319 states and 481 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:50,768 INFO L93 Difference]: Finished difference Result 668 states and 1021 transitions. [2024-10-24 00:46:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:46:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-10-24 00:46:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:50,772 INFO L225 Difference]: With dead ends: 668 [2024-10-24 00:46:50,772 INFO L226 Difference]: Without dead ends: 371 [2024-10-24 00:46:50,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 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-24 00:46:50,774 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 102 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:50,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 904 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:46:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-24 00:46:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 366. [2024-10-24 00:46:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 278 states have (on average 1.5683453237410072) internal successors, (436), 281 states have internal predecessors, (436), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 00:46:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2024-10-24 00:46:50,799 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 103 [2024-10-24 00:46:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:50,799 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2024-10-24 00:46:50,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:46:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2024-10-24 00:46:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:46:50,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:50,802 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-10-24 00:46:50,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:46:51,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:51,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 357840441, now seen corresponding path program 1 times [2024-10-24 00:46:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434348424] [2024-10-24 00:46:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:46:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:46:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:46:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:46:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:46:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:46:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:46:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:46:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:46:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:46:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:51,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434348424] [2024-10-24 00:46:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434348424] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572784961] [2024-10-24 00:46:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:51,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:51,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:51,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:46:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:51,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:46:51,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:46:51,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:51,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572784961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:51,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:51,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:46:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787869724] [2024-10-24 00:46:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:51,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:46:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:46:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:46:51,696 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:51,807 INFO L93 Difference]: Finished difference Result 727 states and 1120 transitions. [2024-10-24 00:46:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:46:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-24 00:46:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:51,811 INFO L225 Difference]: With dead ends: 727 [2024-10-24 00:46:51,811 INFO L226 Difference]: Without dead ends: 368 [2024-10-24 00:46:51,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 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-24 00:46:51,814 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:51,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1825 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:46:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-24 00:46:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-10-24 00:46:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 283 states have internal predecessors, (437), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2024-10-24 00:46:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2024-10-24 00:46:51,852 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 104 [2024-10-24 00:46:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:51,856 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2024-10-24 00:46:51,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2024-10-24 00:46:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:46:51,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:51,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-24 00:46:51,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:46:52,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:52,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:52,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1965777925, now seen corresponding path program 1 times [2024-10-24 00:46:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706325520] [2024-10-24 00:46:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:46:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:46:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:46:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:46:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:46:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:46:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:46:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:46:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:46:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:46:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706325520] [2024-10-24 00:46:52,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706325520] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133815638] [2024-10-24 00:46:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:52,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:52,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:52,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:52,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:46:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:52,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:46:52,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:46:52,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:52,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133815638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:52,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:52,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:46:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107261189] [2024-10-24 00:46:52,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:52,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:46:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:52,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:46:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:46:52,693 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:52,821 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2024-10-24 00:46:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:46:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-24 00:46:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:52,826 INFO L225 Difference]: With dead ends: 729 [2024-10-24 00:46:52,826 INFO L226 Difference]: Without dead ends: 370 [2024-10-24 00:46:52,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 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-24 00:46:52,829 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 2 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:52,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1811 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:46:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-24 00:46:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-10-24 00:46:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-24 00:46:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 572 transitions. [2024-10-24 00:46:52,864 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 572 transitions. Word has length 105 [2024-10-24 00:46:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 572 transitions. [2024-10-24 00:46:52,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 572 transitions. [2024-10-24 00:46:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:46:52,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:52,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:52,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:46:53,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:53,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:53,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1037844344, now seen corresponding path program 1 times [2024-10-24 00:46:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551766284] [2024-10-24 00:46:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:46:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:46:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:46:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:46:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:46:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:46:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:46:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:53,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551766284] [2024-10-24 00:46:53,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551766284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:53,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:53,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:46:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811097961] [2024-10-24 00:46:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:53,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:46:53,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:53,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:46:53,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:53,303 INFO L87 Difference]: Start difference. First operand 370 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:55,271 INFO L93 Difference]: Finished difference Result 807 states and 1260 transitions. [2024-10-24 00:46:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:46:55,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-24 00:46:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:55,277 INFO L225 Difference]: With dead ends: 807 [2024-10-24 00:46:55,277 INFO L226 Difference]: Without dead ends: 456 [2024-10-24 00:46:55,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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-24 00:46:55,281 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1038 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:55,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 968 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:46:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-24 00:46:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 370. [2024-10-24 00:46:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2024-10-24 00:46:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 571 transitions. [2024-10-24 00:46:55,329 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 571 transitions. Word has length 106 [2024-10-24 00:46:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:55,329 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 571 transitions. [2024-10-24 00:46:55,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 571 transitions. [2024-10-24 00:46:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:46:55,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:55,333 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:46:55,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:55,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash 289902940, now seen corresponding path program 2 times [2024-10-24 00:46:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978808399] [2024-10-24 00:46:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:46:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:46:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:46:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:46:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:46:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:46:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:46:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:46:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:55,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978808399] [2024-10-24 00:46:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978808399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:55,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:46:55,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820940090] [2024-10-24 00:46:55,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:55,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:46:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:46:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:46:55,582 INFO L87 Difference]: Start difference. First operand 370 states and 571 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:57,467 INFO L93 Difference]: Finished difference Result 809 states and 1263 transitions. [2024-10-24 00:46:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:46:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-24 00:46:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:57,472 INFO L225 Difference]: With dead ends: 809 [2024-10-24 00:46:57,472 INFO L226 Difference]: Without dead ends: 458 [2024-10-24 00:46:57,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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-24 00:46:57,474 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1034 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:57,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 968 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:46:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-24 00:46:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-24 00:46:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (71), 63 states have call predecessors, (71), 63 states have call successors, (71) [2024-10-24 00:46:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 574 transitions. [2024-10-24 00:46:57,516 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 574 transitions. Word has length 107 [2024-10-24 00:46:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:57,518 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 574 transitions. [2024-10-24 00:46:57,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:46:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 574 transitions. [2024-10-24 00:46:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:46:57,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:57,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:46:57,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:46:57,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:57,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -172335405, now seen corresponding path program 1 times [2024-10-24 00:46:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573527656] [2024-10-24 00:46:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:57,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:46:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:46:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:46:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:46:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:46:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:46:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:46:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:46:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573527656] [2024-10-24 00:46:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573527656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:46:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415326637] [2024-10-24 00:46:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:57,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:46:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:46:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:46:57,767 INFO L87 Difference]: Start difference. First operand 372 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:00,228 INFO L93 Difference]: Finished difference Result 807 states and 1258 transitions. [2024-10-24 00:47:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:47:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 108 [2024-10-24 00:47:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:00,232 INFO L225 Difference]: With dead ends: 807 [2024-10-24 00:47:00,232 INFO L226 Difference]: Without dead ends: 458 [2024-10-24 00:47:00,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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-24 00:47:00,235 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1038 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3632 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 3632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:00,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1343 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 3632 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:47:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-24 00:47:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-24 00:47:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-24 00:47:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2024-10-24 00:47:00,292 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 108 [2024-10-24 00:47:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:00,293 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2024-10-24 00:47:00,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2024-10-24 00:47:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:47:00,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:00,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:47:00,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:47:00,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:00,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:00,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1381306204, now seen corresponding path program 2 times [2024-10-24 00:47:00,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672619982] [2024-10-24 00:47:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:00,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:47:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:47:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:47:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:47:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:47:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:47:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:47:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:47:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:00,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672619982] [2024-10-24 00:47:00,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672619982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:47:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240296627] [2024-10-24 00:47:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:00,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:47:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:47:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:47:00,541 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:02,719 INFO L93 Difference]: Finished difference Result 809 states and 1264 transitions. [2024-10-24 00:47:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:47:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-24 00:47:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:02,723 INFO L225 Difference]: With dead ends: 809 [2024-10-24 00:47:02,723 INFO L226 Difference]: Without dead ends: 460 [2024-10-24 00:47:02,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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-24 00:47:02,725 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1034 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:02,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1344 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 00:47:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-24 00:47:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 374. [2024-10-24 00:47:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 282 states have (on average 1.5602836879432624) internal successors, (440), 289 states have internal predecessors, (440), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2024-10-24 00:47:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2024-10-24 00:47:02,754 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 109 [2024-10-24 00:47:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:02,754 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2024-10-24 00:47:02,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:47:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2024-10-24 00:47:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:47:02,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:02,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:47:02,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:47:02,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 271481870, now seen corresponding path program 1 times [2024-10-24 00:47:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073686052] [2024-10-24 00:47:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:02,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:47:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:47:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:47:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:47:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:47:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:47:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:47:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 00:47:03,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:03,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073686052] [2024-10-24 00:47:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073686052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:47:03,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979037721] [2024-10-24 00:47:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:03,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:47:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:47:03,041 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:47:03,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:47:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:03,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:47:03,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:47:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:03,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:47:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979037721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:47:03,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:47:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-24 00:47:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437933310] [2024-10-24 00:47:03,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:47:03,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 00:47:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 00:47:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:47:03,450 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 00:47:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:05,939 INFO L93 Difference]: Finished difference Result 1138 states and 1875 transitions. [2024-10-24 00:47:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:47:05,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2024-10-24 00:47:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:05,945 INFO L225 Difference]: With dead ends: 1138 [2024-10-24 00:47:05,945 INFO L226 Difference]: Without dead ends: 790 [2024-10-24 00:47:05,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-24 00:47:05,948 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 2087 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 4033 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2104 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 4706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 4033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:05,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2104 Valid, 1492 Invalid, 4706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 4033 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:47:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-24 00:47:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 689. [2024-10-24 00:47:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 533 states have (on average 1.6097560975609757) internal successors, (858), 540 states have internal predecessors, (858), 128 states have call successors, (128), 23 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2024-10-24 00:47:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1135 transitions. [2024-10-24 00:47:05,991 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1135 transitions. Word has length 110 [2024-10-24 00:47:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:05,992 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1135 transitions. [2024-10-24 00:47:05,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 00:47:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1135 transitions. [2024-10-24 00:47:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 00:47:05,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:05,998 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-24 00:47:06,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 00:47:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:47:06,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1738925346, now seen corresponding path program 1 times [2024-10-24 00:47:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830300914] [2024-10-24 00:47:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:47:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:47:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:47:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:47:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:47:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:47:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:47:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:06,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830300914] [2024-10-24 00:47:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830300914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:06,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:06,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:06,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123922237] [2024-10-24 00:47:06,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:06,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:06,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:06,344 INFO L87 Difference]: Start difference. First operand 689 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:07,468 INFO L93 Difference]: Finished difference Result 1693 states and 2864 transitions. [2024-10-24 00:47:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-24 00:47:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:07,475 INFO L225 Difference]: With dead ends: 1693 [2024-10-24 00:47:07,476 INFO L226 Difference]: Without dead ends: 1072 [2024-10-24 00:47:07,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:07,479 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1132 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:07,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 719 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:47:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-24 00:47:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 981. [2024-10-24 00:47:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 761 states have (on average 1.6228646517739815) internal successors, (1235), 768 states have internal predecessors, (1235), 192 states have call successors, (192), 23 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2024-10-24 00:47:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1650 transitions. [2024-10-24 00:47:07,565 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1650 transitions. Word has length 114 [2024-10-24 00:47:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:07,565 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1650 transitions. [2024-10-24 00:47:07,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1650 transitions. [2024-10-24 00:47:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:47:07,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:07,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-24 00:47:07,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:47:07,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1928759165, now seen corresponding path program 1 times [2024-10-24 00:47:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499560713] [2024-10-24 00:47:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:47:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:47:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:47:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:47:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:47:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:47:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:47:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:07,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499560713] [2024-10-24 00:47:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499560713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:07,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52160043] [2024-10-24 00:47:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:07,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:07,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:07,689 INFO L87 Difference]: Start difference. First operand 981 states and 1650 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:08,872 INFO L93 Difference]: Finished difference Result 2410 states and 4121 transitions. [2024-10-24 00:47:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-24 00:47:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:08,881 INFO L225 Difference]: With dead ends: 2410 [2024-10-24 00:47:08,881 INFO L226 Difference]: Without dead ends: 1547 [2024-10-24 00:47:08,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:08,886 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1130 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:08,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 704 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:47:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-24 00:47:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1456. [2024-10-24 00:47:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1141 states have (on average 1.6292725679228748) internal successors, (1859), 1148 states have internal predecessors, (1859), 287 states have call successors, (287), 23 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2024-10-24 00:47:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2464 transitions. [2024-10-24 00:47:08,977 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2464 transitions. Word has length 115 [2024-10-24 00:47:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:08,977 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2464 transitions. [2024-10-24 00:47:08,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2464 transitions. [2024-10-24 00:47:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:47:08,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:08,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-24 00:47:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:47:08,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:08,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -216037200, now seen corresponding path program 1 times [2024-10-24 00:47:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957831324] [2024-10-24 00:47:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:47:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:47:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:47:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:47:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:47:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:47:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:47:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:09,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957831324] [2024-10-24 00:47:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957831324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:09,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837040976] [2024-10-24 00:47:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:09,097 INFO L87 Difference]: Start difference. First operand 1456 states and 2464 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:10,323 INFO L93 Difference]: Finished difference Result 3472 states and 5999 transitions. [2024-10-24 00:47:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-24 00:47:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:10,340 INFO L225 Difference]: With dead ends: 3472 [2024-10-24 00:47:10,340 INFO L226 Difference]: Without dead ends: 2262 [2024-10-24 00:47:10,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:10,346 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1128 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:10,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 702 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:47:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-10-24 00:47:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2171. [2024-10-24 00:47:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1733 states have (on average 1.634737449509521) internal successors, (2833), 1740 states have internal predecessors, (2833), 410 states have call successors, (410), 23 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2024-10-24 00:47:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3700 transitions. [2024-10-24 00:47:10,468 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3700 transitions. Word has length 116 [2024-10-24 00:47:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:10,468 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3700 transitions. [2024-10-24 00:47:10,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3700 transitions. [2024-10-24 00:47:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:47:10,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:10,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:47:10,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:47:10,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1388657764, now seen corresponding path program 1 times [2024-10-24 00:47:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683429359] [2024-10-24 00:47:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:47:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:47:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:47:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:47:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:47:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:47:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:47:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:10,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683429359] [2024-10-24 00:47:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683429359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:10,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448392377] [2024-10-24 00:47:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:10,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:10,595 INFO L87 Difference]: Start difference. First operand 2171 states and 3700 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:11,882 INFO L93 Difference]: Finished difference Result 5114 states and 8912 transitions. [2024-10-24 00:47:11,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:11,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-24 00:47:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:11,903 INFO L225 Difference]: With dead ends: 5114 [2024-10-24 00:47:11,903 INFO L226 Difference]: Without dead ends: 3398 [2024-10-24 00:47:11,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:11,912 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1126 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:11,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 705 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:47:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2024-10-24 00:47:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3307. [2024-10-24 00:47:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2690 states have (on average 1.6382899628252787) internal successors, (4407), 2697 states have internal predecessors, (4407), 589 states have call successors, (589), 23 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2024-10-24 00:47:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 5658 transitions. [2024-10-24 00:47:12,120 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 5658 transitions. Word has length 117 [2024-10-24 00:47:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:12,120 INFO L471 AbstractCegarLoop]: Abstraction has 3307 states and 5658 transitions. [2024-10-24 00:47:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 5658 transitions. [2024-10-24 00:47:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:47:12,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:12,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-24 00:47:12,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:47:12,132 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 284689556, now seen corresponding path program 1 times [2024-10-24 00:47:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675006335] [2024-10-24 00:47:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:47:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:47:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:47:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:47:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:47:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:47:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:47:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675006335] [2024-10-24 00:47:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675006335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:12,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:12,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:12,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973742820] [2024-10-24 00:47:12,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:12,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:12,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:12,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:12,241 INFO L87 Difference]: Start difference. First operand 3307 states and 5658 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:13,630 INFO L93 Difference]: Finished difference Result 8069 states and 14110 transitions. [2024-10-24 00:47:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-24 00:47:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:13,662 INFO L225 Difference]: With dead ends: 8069 [2024-10-24 00:47:13,663 INFO L226 Difference]: Without dead ends: 5456 [2024-10-24 00:47:13,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:13,676 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1124 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:13,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 744 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:47:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2024-10-24 00:47:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5365. [2024-10-24 00:47:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4372 states have (on average 1.630832570905764) internal successors, (7130), 4379 states have internal predecessors, (7130), 965 states have call successors, (965), 23 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2024-10-24 00:47:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 9177 transitions. [2024-10-24 00:47:13,972 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 9177 transitions. Word has length 118 [2024-10-24 00:47:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 9177 transitions. [2024-10-24 00:47:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 9177 transitions. [2024-10-24 00:47:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:47:13,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:13,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-24 00:47:13,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:47:13,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:13,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash -94214216, now seen corresponding path program 1 times [2024-10-24 00:47:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728602769] [2024-10-24 00:47:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:47:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:47:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:47:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:47:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:47:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:47:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:47:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:14,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:14,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728602769] [2024-10-24 00:47:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728602769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:14,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261190283] [2024-10-24 00:47:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:14,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:14,111 INFO L87 Difference]: Start difference. First operand 5365 states and 9177 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:15,452 INFO L93 Difference]: Finished difference Result 13274 states and 23194 transitions. [2024-10-24 00:47:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-24 00:47:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:15,506 INFO L225 Difference]: With dead ends: 13274 [2024-10-24 00:47:15,507 INFO L226 Difference]: Without dead ends: 8989 [2024-10-24 00:47:15,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:15,529 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1122 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:15,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 715 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:47:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-10-24 00:47:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8898. [2024-10-24 00:47:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 7299 states have (on average 1.628579257432525) internal successors, (11887), 7306 states have internal predecessors, (11887), 1571 states have call successors, (1571), 23 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2024-10-24 00:47:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 15224 transitions. [2024-10-24 00:47:16,012 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 15224 transitions. Word has length 119 [2024-10-24 00:47:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 8898 states and 15224 transitions. [2024-10-24 00:47:16,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 15224 transitions. [2024-10-24 00:47:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 00:47:16,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:16,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:47:16,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:47:16,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:16,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1189824782, now seen corresponding path program 1 times [2024-10-24 00:47:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306394046] [2024-10-24 00:47:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:47:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:47:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:47:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:47:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:47:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:47:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:47:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306394046] [2024-10-24 00:47:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306394046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:16,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:16,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:16,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354407076] [2024-10-24 00:47:16,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:16,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:16,154 INFO L87 Difference]: Start difference. First operand 8898 states and 15224 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:17,583 INFO L93 Difference]: Finished difference Result 23046 states and 40223 transitions. [2024-10-24 00:47:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:17,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-24 00:47:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:17,642 INFO L225 Difference]: With dead ends: 23046 [2024-10-24 00:47:17,642 INFO L226 Difference]: Without dead ends: 15661 [2024-10-24 00:47:17,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:17,669 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1120 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:17,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 749 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:47:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15661 states. [2024-10-24 00:47:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15661 to 15570. [2024-10-24 00:47:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15570 states, 12768 states have (on average 1.619360902255639) internal successors, (20676), 12775 states have internal predecessors, (20676), 2774 states have call successors, (2774), 23 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2024-10-24 00:47:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 26563 transitions. [2024-10-24 00:47:18,309 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 26563 transitions. Word has length 120 [2024-10-24 00:47:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:18,309 INFO L471 AbstractCegarLoop]: Abstraction has 15570 states and 26563 transitions. [2024-10-24 00:47:18,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 26563 transitions. [2024-10-24 00:47:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 00:47:18,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:18,343 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-24 00:47:18,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:47:18,344 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash 914824247, now seen corresponding path program 1 times [2024-10-24 00:47:18,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:18,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411710853] [2024-10-24 00:47:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:47:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:47:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:47:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:47:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:47:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:47:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:47:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:18,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411710853] [2024-10-24 00:47:18,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411710853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:18,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:18,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:18,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945477402] [2024-10-24 00:47:18,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:18,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:18,467 INFO L87 Difference]: Start difference. First operand 15570 states and 26563 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:20,376 INFO L93 Difference]: Finished difference Result 41213 states and 71821 transitions. [2024-10-24 00:47:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-24 00:47:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:20,525 INFO L225 Difference]: With dead ends: 41213 [2024-10-24 00:47:20,525 INFO L226 Difference]: Without dead ends: 27776 [2024-10-24 00:47:20,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:20,588 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1118 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:20,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 706 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:47:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27776 states. [2024-10-24 00:47:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27776 to 27685. [2024-10-24 00:47:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27685 states, 22844 states have (on average 1.6154351251969883) internal successors, (36903), 22851 states have internal predecessors, (36903), 4813 states have call successors, (4813), 23 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2024-10-24 00:47:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 47142 transitions. [2024-10-24 00:47:21,997 INFO L78 Accepts]: Start accepts. Automaton has 27685 states and 47142 transitions. Word has length 121 [2024-10-24 00:47:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 27685 states and 47142 transitions. [2024-10-24 00:47:21,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27685 states and 47142 transitions. [2024-10-24 00:47:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 00:47:22,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:22,031 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-24 00:47:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:47:22,031 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash 856132848, now seen corresponding path program 1 times [2024-10-24 00:47:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:22,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819830232] [2024-10-24 00:47:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:47:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:47:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:47:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:47:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:47:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:47:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:47:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819830232] [2024-10-24 00:47:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819830232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472842229] [2024-10-24 00:47:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:22,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:22,144 INFO L87 Difference]: Start difference. First operand 27685 states and 47142 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:24,809 INFO L93 Difference]: Finished difference Result 75405 states and 130615 transitions. [2024-10-24 00:47:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-24 00:47:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:25,024 INFO L225 Difference]: With dead ends: 75405 [2024-10-24 00:47:25,025 INFO L226 Difference]: Without dead ends: 50600 [2024-10-24 00:47:25,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:25,107 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1116 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:25,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 714 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:47:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50600 states. [2024-10-24 00:47:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50600 to 50509. [2024-10-24 00:47:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50509 states, 41953 states have (on average 1.6101589874383238) internal successors, (67551), 41960 states have internal predecessors, (67551), 8528 states have call successors, (8528), 23 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2024-10-24 00:47:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50509 states to 50509 states and 85752 transitions. [2024-10-24 00:47:27,344 INFO L78 Accepts]: Start accepts. Automaton has 50509 states and 85752 transitions. Word has length 122 [2024-10-24 00:47:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 50509 states and 85752 transitions. [2024-10-24 00:47:27,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 50509 states and 85752 transitions. [2024-10-24 00:47:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:47:27,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:27,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-24 00:47:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:47:27,381 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -789808905, now seen corresponding path program 1 times [2024-10-24 00:47:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581858766] [2024-10-24 00:47:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:47:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:47:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:47:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:47:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:47:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:47:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:47:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:27,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:27,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581858766] [2024-10-24 00:47:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581858766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:47:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769030186] [2024-10-24 00:47:27,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:27,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:47:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:47:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:47:27,494 INFO L87 Difference]: Start difference. First operand 50509 states and 85752 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:30,904 INFO L93 Difference]: Finished difference Result 94152 states and 163521 transitions. [2024-10-24 00:47:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:47:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-24 00:47:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:31,314 INFO L225 Difference]: With dead ends: 94152 [2024-10-24 00:47:31,315 INFO L226 Difference]: Without dead ends: 93980 [2024-10-24 00:47:31,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-24 00:47:31,370 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1111 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:31,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 712 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:47:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93980 states. [2024-10-24 00:47:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93980 to 93889. [2024-10-24 00:47:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93889 states, 78534 states have (on average 1.6033692413476965) internal successors, (125919), 78541 states have internal predecessors, (125919), 15327 states have call successors, (15327), 23 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2024-10-24 00:47:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 158764 transitions. [2024-10-24 00:47:35,057 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 158764 transitions. Word has length 123 [2024-10-24 00:47:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:35,058 INFO L471 AbstractCegarLoop]: Abstraction has 93889 states and 158764 transitions. [2024-10-24 00:47:35,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:47:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 158764 transitions. [2024-10-24 00:47:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:47:35,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:35,100 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-24 00:47:35,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:47:35,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 288645361, now seen corresponding path program 1 times [2024-10-24 00:47:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:35,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280286936] [2024-10-24 00:47:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:47:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:47:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:47:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:47:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:47:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:47:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:47:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280286936] [2024-10-24 00:47:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280286936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 00:47:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255473346] [2024-10-24 00:47:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:36,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 00:47:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 00:47:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-24 00:47:36,052 INFO L87 Difference]: Start difference. First operand 93889 states and 158764 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:47:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:47:45,902 INFO L93 Difference]: Finished difference Result 187571 states and 329127 transitions. [2024-10-24 00:47:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-24 00:47:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2024-10-24 00:47:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:47:47,092 INFO L225 Difference]: With dead ends: 187571 [2024-10-24 00:47:47,092 INFO L226 Difference]: Without dead ends: 187404 [2024-10-24 00:47:47,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-24 00:47:47,171 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 4082 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 7035 mSolverCounterSat, 1355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 8390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1355 IncrementalHoareTripleChecker+Valid, 7035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:47:47,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 2302 Invalid, 8390 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1355 Valid, 7035 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 00:47:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187404 states. [2024-10-24 00:47:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187404 to 187002. [2024-10-24 00:47:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187002 states, 156479 states have (on average 1.6042791684507187) internal successors, (251036), 156384 states have internal predecessors, (251036), 30451 states have call successors, (30451), 62 states have call predecessors, (30451), 71 states have return successors, (38109), 30561 states have call predecessors, (38109), 30448 states have call successors, (38109) [2024-10-24 00:47:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187002 states to 187002 states and 319596 transitions. [2024-10-24 00:47:55,797 INFO L78 Accepts]: Start accepts. Automaton has 187002 states and 319596 transitions. Word has length 124 [2024-10-24 00:47:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:47:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 187002 states and 319596 transitions. [2024-10-24 00:47:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:47:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 187002 states and 319596 transitions. [2024-10-24 00:47:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:47:55,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:47:55,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-24 00:47:55,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:47:55,861 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:47:55,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:47:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -297384943, now seen corresponding path program 1 times [2024-10-24 00:47:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:47:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73524665] [2024-10-24 00:47:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:47:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:47:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:47:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:47:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:47:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:47:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:47:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:47:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:47:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:47:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:47:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:47:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:47:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:47:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:47:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:47:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:47:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:47:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73524665] [2024-10-24 00:47:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73524665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:47:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:47:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:47:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308651107] [2024-10-24 00:47:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:47:56,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:47:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:47:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:47:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:47:56,127 INFO L87 Difference]: Start difference. First operand 187002 states and 319596 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13)