./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_spec11_productSimulator.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_spec11_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:45:28,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:45:28,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:45:28,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:45:28,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:45:28,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:45:28,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:45:28,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:45:28,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:45:28,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:45:28,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:45:28,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:45:28,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:45:28,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:45:28,355 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:45:28,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:45:28,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:45:28,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:45:28,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:45:28,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:45:28,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:45:28,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:45:28,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:45:28,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:45:28,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:45:28,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:45:28,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:45:28,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:45:28,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:45:28,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:45:28,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:45:28,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:45:28,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:45:28,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:45:28,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:45:28,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:45:28,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:45:28,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:45:28,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:45:28,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:45:28,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:45:28,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:45:28,368 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 -> 1c5af94617941f44648ac9498189d5e73562b4cbf6ae0ea00b10262137b50bb0 [2024-10-24 00:45:28,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:45:28,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:45:28,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:45:28,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:45:28,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:45:28,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2024-10-24 00:45:30,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:45:30,526 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:45:30,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_productSimulator.cil.c [2024-10-24 00:45:30,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83299d5f8/de63667cd4ea4e60a3d552723444eb4e/FLAG59ccfb0dd [2024-10-24 00:45:30,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83299d5f8/de63667cd4ea4e60a3d552723444eb4e [2024-10-24 00:45:30,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:45:30,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:45:30,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:45:30,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:45:30,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:45:30,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:45:30" (1/1) ... [2024-10-24 00:45:30,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3f5b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:30, skipping insertion in model container [2024-10-24 00:45:30,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:45:30" (1/1) ... [2024-10-24 00:45:30,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:45:31,272 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_spec11_productSimulator.cil.c[48047,48060] [2024-10-24 00:45:31,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:45:31,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:45:31,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-24 00:45:31,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2024-10-24 00:45:31,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [754] [2024-10-24 00:45:31,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1126] [2024-10-24 00:45:31,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1492] [2024-10-24 00:45:31,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1698] [2024-10-24 00:45:31,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2095] [2024-10-24 00:45:31,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2112] [2024-10-24 00:45:31,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2378] [2024-10-24 00:45:31,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2387] [2024-10-24 00:45:31,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [3447] [2024-10-24 00:45:31,451 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_spec11_productSimulator.cil.c[48047,48060] [2024-10-24 00:45:31,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:45:31,528 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:45:31,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31 WrapperNode [2024-10-24 00:45:31,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:45:31,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:45:31,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:45:31,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:45:31,535 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:45:31" (1/1) ... [2024-10-24 00:45:31,571 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:45:31" (1/1) ... [2024-10-24 00:45:31,638 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1311 [2024-10-24 00:45:31,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:45:31,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:45:31,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:45:31,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:45:31,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,703 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:45:31,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:45:31,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:45:31,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:45:31,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:45:31,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (1/1) ... [2024-10-24 00:45:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:45:31,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:31,855 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:45:31,858 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:45:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:45:31,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:45:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2024-10-24 00:45:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2024-10-24 00:45:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2024-10-24 00:45:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2024-10-24 00:45:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-24 00:45:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-24 00:45:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:45:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:45:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-24 00:45:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-24 00:45:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:45:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:45:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2024-10-24 00:45:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2024-10-24 00:45:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:45:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:45:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2024-10-24 00:45:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2024-10-24 00:45:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:45:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:45:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:45:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:45:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:45:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:45:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2024-10-24 00:45:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2024-10-24 00:45:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2024-10-24 00:45:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2024-10-24 00:45:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:45:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:45:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:45:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:45:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:45:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:45:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2024-10-24 00:45:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2024-10-24 00:45:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:45:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:45:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-24 00:45:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-24 00:45:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:45:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:45:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2024-10-24 00:45:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2024-10-24 00:45:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:45:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:45:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:45:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:45:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:45:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2024-10-24 00:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2024-10-24 00:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2024-10-24 00:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2024-10-24 00:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2024-10-24 00:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2024-10-24 00:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-24 00:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-24 00:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:45:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:45:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2024-10-24 00:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2024-10-24 00:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2024-10-24 00:45:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2024-10-24 00:45:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:45:31,908 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:45:31,908 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:45:31,908 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2024-10-24 00:45:31,908 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2024-10-24 00:45:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2024-10-24 00:45:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2024-10-24 00:45:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-24 00:45:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-24 00:45:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:45:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:45:32,128 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:45:32,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:45:33,419 INFO L? ?]: Removed 626 outVars from TransFormulas that were not future-live. [2024-10-24 00:45:33,419 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:45:33,509 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:45:33,509 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:45:33,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:45:33 BoogieIcfgContainer [2024-10-24 00:45:33,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:45:33,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:45:33,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:45:33,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:45:33,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:45:30" (1/3) ... [2024-10-24 00:45:33,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e065df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:45:33, skipping insertion in model container [2024-10-24 00:45:33,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:31" (2/3) ... [2024-10-24 00:45:33,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e065df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:45:33, skipping insertion in model container [2024-10-24 00:45:33,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:45:33" (3/3) ... [2024-10-24 00:45:33,521 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_productSimulator.cil.c [2024-10-24 00:45:33,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:45:33,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:45:33,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:45:33,643 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;@226f444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:45:33,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:45:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 417 states have (on average 1.5515587529976018) internal successors, (647), 437 states have internal predecessors, (647), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-24 00:45:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 00:45:33,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:33,678 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:33,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:33,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash -483827818, now seen corresponding path program 1 times [2024-10-24 00:45:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575855474] [2024-10-24 00:45:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:45:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:45:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:45:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:45:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:45:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:45:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:45:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:45:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 00:45:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-24 00:45:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:34,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575855474] [2024-10-24 00:45:34,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575855474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:34,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:34,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:45:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074038826] [2024-10-24 00:45:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:45:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:45:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:45:34,563 INFO L87 Difference]: Start difference. First operand has 571 states, 417 states have (on average 1.5515587529976018) internal successors, (647), 437 states have internal predecessors, (647), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:37,422 INFO L93 Difference]: Finished difference Result 1232 states and 1924 transitions. [2024-10-24 00:45:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:45:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2024-10-24 00:45:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:37,447 INFO L225 Difference]: With dead ends: 1232 [2024-10-24 00:45:37,448 INFO L226 Difference]: Without dead ends: 690 [2024-10-24 00:45:37,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:45:37,462 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1327 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 3101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:37,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 1411 Invalid, 3101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 00:45:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-24 00:45:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 568. [2024-10-24 00:45:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 434 states have internal predecessors, (633), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-24 00:45:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 850 transitions. [2024-10-24 00:45:37,627 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 850 transitions. Word has length 139 [2024-10-24 00:45:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:37,630 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 850 transitions. [2024-10-24 00:45:37,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 850 transitions. [2024-10-24 00:45:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 00:45:37,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:37,643 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:37,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:45:37,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:37,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1339543914, now seen corresponding path program 1 times [2024-10-24 00:45:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398182001] [2024-10-24 00:45:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:37,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:45:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:45:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:45:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:45:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:45:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:45:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 00:45:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 00:45:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398182001] [2024-10-24 00:45:38,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398182001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:38,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414113984] [2024-10-24 00:45:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:38,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:38,206 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:45:38,210 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:45:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:38,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:45:38,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-24 00:45:38,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414113984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-24 00:45:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107966085] [2024-10-24 00:45:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:38,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:45:38,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:38,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:45:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:45:38,663 INFO L87 Difference]: Start difference. First operand 568 states and 850 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:38,761 INFO L93 Difference]: Finished difference Result 880 states and 1292 transitions. [2024-10-24 00:45:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:45:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 145 [2024-10-24 00:45:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:38,766 INFO L225 Difference]: With dead ends: 880 [2024-10-24 00:45:38,766 INFO L226 Difference]: Without dead ends: 570 [2024-10-24 00:45:38,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:45:38,769 INFO L432 NwaCegarLoop]: 829 mSDtfsCounter, 0 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:38,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1657 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:45:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-24 00:45:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-10-24 00:45:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 417 states have (on average 1.5227817745803358) internal successors, (635), 436 states have internal predecessors, (635), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-24 00:45:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 852 transitions. [2024-10-24 00:45:38,820 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 852 transitions. Word has length 145 [2024-10-24 00:45:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:38,821 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 852 transitions. [2024-10-24 00:45:38,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 852 transitions. [2024-10-24 00:45:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 00:45:38,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:38,828 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:38,849 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:45:39,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:39,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:39,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -915338777, now seen corresponding path program 1 times [2024-10-24 00:45:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493572323] [2024-10-24 00:45:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:45:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:45:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:45:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:45:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:45:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 00:45:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 00:45:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 00:45:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:39,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493572323] [2024-10-24 00:45:39,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493572323] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44240809] [2024-10-24 00:45:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:39,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:39,435 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:45:39,436 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:45:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:39,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:45:39,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-24 00:45:39,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:39,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44240809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:39,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:39,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-10-24 00:45:39,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885399134] [2024-10-24 00:45:39,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:39,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:45:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:45:39,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:45:39,960 INFO L87 Difference]: Start difference. First operand 570 states and 852 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 00:45:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:40,183 INFO L93 Difference]: Finished difference Result 1092 states and 1638 transitions. [2024-10-24 00:45:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:45:40,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 151 [2024-10-24 00:45:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:40,189 INFO L225 Difference]: With dead ends: 1092 [2024-10-24 00:45:40,189 INFO L226 Difference]: Without dead ends: 575 [2024-10-24 00:45:40,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:45:40,193 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 4 mSDsluCounter, 4067 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4884 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:40,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4884 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:45:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-24 00:45:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 574. [2024-10-24 00:45:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 419 states have (on average 1.5202863961813842) internal successors, (637), 439 states have internal predecessors, (637), 109 states have call successors, (109), 43 states have call predecessors, (109), 45 states have return successors, (112), 108 states have call predecessors, (112), 108 states have call successors, (112) [2024-10-24 00:45:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 858 transitions. [2024-10-24 00:45:40,286 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 858 transitions. Word has length 151 [2024-10-24 00:45:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:40,286 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 858 transitions. [2024-10-24 00:45:40,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 00:45:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 858 transitions. [2024-10-24 00:45:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 00:45:40,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:40,292 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 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:45:40,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:45:40,493 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,SelfDestructingSolverStorable2 [2024-10-24 00:45:40,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1929952825, now seen corresponding path program 1 times [2024-10-24 00:45:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:40,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322088286] [2024-10-24 00:45:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:45:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:45:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:45:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:45:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 00:45:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 00:45:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 00:45:40,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322088286] [2024-10-24 00:45:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322088286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:40,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:40,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 00:45:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153106495] [2024-10-24 00:45:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:40,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:45:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:40,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:45:40,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:40,819 INFO L87 Difference]: Start difference. First operand 574 states and 858 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 00:45:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:44,527 INFO L93 Difference]: Finished difference Result 1200 states and 1835 transitions. [2024-10-24 00:45:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 00:45:44,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 152 [2024-10-24 00:45:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:44,539 INFO L225 Difference]: With dead ends: 1200 [2024-10-24 00:45:44,540 INFO L226 Difference]: Without dead ends: 699 [2024-10-24 00:45:44,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-10-24 00:45:44,544 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1333 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 5314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:44,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 2068 Invalid, 5314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 00:45:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-24 00:45:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 576. [2024-10-24 00:45:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 420 states have (on average 1.519047619047619) internal successors, (638), 440 states have internal predecessors, (638), 109 states have call successors, (109), 43 states have call predecessors, (109), 46 states have return successors, (113), 109 states have call predecessors, (113), 108 states have call successors, (113) [2024-10-24 00:45:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 860 transitions. [2024-10-24 00:45:44,614 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 860 transitions. Word has length 152 [2024-10-24 00:45:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 860 transitions. [2024-10-24 00:45:44,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 00:45:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 860 transitions. [2024-10-24 00:45:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 00:45:44,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:44,622 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:44,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 00:45:44,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:44,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2129832287, now seen corresponding path program 2 times [2024-10-24 00:45:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513133628] [2024-10-24 00:45:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:45:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:45:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:45:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:45:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 00:45:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 00:45:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 00:45:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513133628] [2024-10-24 00:45:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513133628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 00:45:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579983415] [2024-10-24 00:45:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:45:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:45:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:44,925 INFO L87 Difference]: Start difference. First operand 576 states and 860 transitions. Second operand has 10 states, 9 states have (on average 10.0) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 00:45:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:48,058 INFO L93 Difference]: Finished difference Result 1204 states and 1841 transitions. [2024-10-24 00:45:48,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 00:45:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.0) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 153 [2024-10-24 00:45:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:48,065 INFO L225 Difference]: With dead ends: 1204 [2024-10-24 00:45:48,065 INFO L226 Difference]: Without dead ends: 703 [2024-10-24 00:45:48,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-10-24 00:45:48,068 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1328 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 4759 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 5348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:48,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2068 Invalid, 5348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 4759 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 00:45:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-10-24 00:45:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 578. [2024-10-24 00:45:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 421 states have (on average 1.517814726840855) internal successors, (639), 442 states have internal predecessors, (639), 109 states have call successors, (109), 43 states have call predecessors, (109), 47 states have return successors, (116), 109 states have call predecessors, (116), 108 states have call successors, (116) [2024-10-24 00:45:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 864 transitions. [2024-10-24 00:45:48,112 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 864 transitions. Word has length 153 [2024-10-24 00:45:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:48,113 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 864 transitions. [2024-10-24 00:45:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.0) internal successors, (90), 7 states have internal predecessors, (90), 4 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 00:45:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 864 transitions. [2024-10-24 00:45:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 00:45:48,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:48,116 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 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:45:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 00:45:48,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash 854361587, now seen corresponding path program 1 times [2024-10-24 00:45:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869473464] [2024-10-24 00:45:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:45:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:45:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:45:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:45:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 00:45:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 00:45:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869473464] [2024-10-24 00:45:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869473464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371252096] [2024-10-24 00:45:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:48,302 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:45:48,304 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:45:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:45:48,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:48,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:45:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371252096] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:45:48,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:45:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-24 00:45:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142760877] [2024-10-24 00:45:48,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:45:48,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:45:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:48,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:45:48,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:48,831 INFO L87 Difference]: Start difference. First operand 578 states and 864 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (45), 5 states have call predecessors, (45), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 00:45:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:51,302 INFO L93 Difference]: Finished difference Result 1370 states and 2153 transitions. [2024-10-24 00:45:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:45:51,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (45), 5 states have call predecessors, (45), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 154 [2024-10-24 00:45:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:51,310 INFO L225 Difference]: With dead ends: 1370 [2024-10-24 00:45:51,310 INFO L226 Difference]: Without dead ends: 1060 [2024-10-24 00:45:51,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:45:51,313 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1964 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:51,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2028 Valid, 1992 Invalid, 3391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 00:45:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-10-24 00:45:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 923. [2024-10-24 00:45:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 715 states have (on average 1.5944055944055944) internal successors, (1140), 742 states have internal predecessors, (1140), 160 states have call successors, (160), 43 states have call predecessors, (160), 47 states have return successors, (167), 160 states have call predecessors, (167), 159 states have call successors, (167) [2024-10-24 00:45:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1467 transitions. [2024-10-24 00:45:51,421 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1467 transitions. Word has length 154 [2024-10-24 00:45:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:51,421 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1467 transitions. [2024-10-24 00:45:51,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (45), 5 states have call predecessors, (45), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 00:45:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1467 transitions. [2024-10-24 00:45:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 00:45:51,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:51,428 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 00:45:51,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:51,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:51,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 541442649, now seen corresponding path program 1 times [2024-10-24 00:45:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:51,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251260753] [2024-10-24 00:45:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:45:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:45:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:45:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 00:45:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 00:45:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 00:45:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:51,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251260753] [2024-10-24 00:45:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251260753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:51,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:51,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:45:51,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227675704] [2024-10-24 00:45:51,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:45:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:45:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:45:51,811 INFO L87 Difference]: Start difference. First operand 923 states and 1467 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:53,490 INFO L93 Difference]: Finished difference Result 2127 states and 3449 transitions. [2024-10-24 00:45:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:45:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-10-24 00:45:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:53,499 INFO L225 Difference]: With dead ends: 2127 [2024-10-24 00:45:53,499 INFO L226 Difference]: Without dead ends: 1313 [2024-10-24 00:45:53,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:53,504 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1486 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:53,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1109 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:45:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-24 00:45:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1186. [2024-10-24 00:45:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 936 states have (on average 1.607905982905983) internal successors, (1505), 969 states have internal predecessors, (1505), 202 states have call successors, (202), 43 states have call predecessors, (202), 47 states have return successors, (209), 202 states have call predecessors, (209), 201 states have call successors, (209) [2024-10-24 00:45:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1916 transitions. [2024-10-24 00:45:53,564 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1916 transitions. Word has length 159 [2024-10-24 00:45:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:53,565 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1916 transitions. [2024-10-24 00:45:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1916 transitions. [2024-10-24 00:45:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 00:45:53,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:53,571 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:53,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:45:53,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1456938822, now seen corresponding path program 1 times [2024-10-24 00:45:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:53,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069520085] [2024-10-24 00:45:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:45:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:45:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:45:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 00:45:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 00:45:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 00:45:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069520085] [2024-10-24 00:45:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069520085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:45:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789938787] [2024-10-24 00:45:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:53,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:45:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:45:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:45:53,731 INFO L87 Difference]: Start difference. First operand 1186 states and 1916 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:55,587 INFO L93 Difference]: Finished difference Result 2859 states and 4709 transitions. [2024-10-24 00:45:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:45:55,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 160 [2024-10-24 00:45:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:55,598 INFO L225 Difference]: With dead ends: 2859 [2024-10-24 00:45:55,598 INFO L226 Difference]: Without dead ends: 1801 [2024-10-24 00:45:55,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:55,602 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1496 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:55,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1118 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:45:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-10-24 00:45:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1674. [2024-10-24 00:45:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1345 states have (on average 1.625278810408922) internal successors, (2186), 1388 states have internal predecessors, (2186), 281 states have call successors, (281), 43 states have call predecessors, (281), 47 states have return successors, (288), 281 states have call predecessors, (288), 280 states have call successors, (288) [2024-10-24 00:45:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2755 transitions. [2024-10-24 00:45:55,675 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2755 transitions. Word has length 160 [2024-10-24 00:45:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2755 transitions. [2024-10-24 00:45:55,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2755 transitions. [2024-10-24 00:45:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 00:45:55,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:55,684 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:55,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:45:55,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1847496736, now seen corresponding path program 1 times [2024-10-24 00:45:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627643337] [2024-10-24 00:45:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:45:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:45:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:45:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:45:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 00:45:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 00:45:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627643337] [2024-10-24 00:45:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627643337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:45:55,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080094196] [2024-10-24 00:45:55,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:55,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:45:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:45:55,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:45:55,820 INFO L87 Difference]: Start difference. First operand 1674 states and 2755 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:57,545 INFO L93 Difference]: Finished difference Result 4070 states and 6798 transitions. [2024-10-24 00:45:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:45:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-10-24 00:45:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:57,561 INFO L225 Difference]: With dead ends: 4070 [2024-10-24 00:45:57,562 INFO L226 Difference]: Without dead ends: 2584 [2024-10-24 00:45:57,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:57,568 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1484 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:57,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1128 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:45:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2024-10-24 00:45:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2457. [2024-10-24 00:45:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2009 states have (on average 1.6391239422598307) internal successors, (3293), 2068 states have internal predecessors, (3293), 400 states have call successors, (400), 43 states have call predecessors, (400), 47 states have return successors, (407), 400 states have call predecessors, (407), 399 states have call successors, (407) [2024-10-24 00:45:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4100 transitions. [2024-10-24 00:45:57,675 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 4100 transitions. Word has length 161 [2024-10-24 00:45:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:57,676 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 4100 transitions. [2024-10-24 00:45:57,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 4100 transitions. [2024-10-24 00:45:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 00:45:57,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:57,689 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:45:57,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash -419829441, now seen corresponding path program 1 times [2024-10-24 00:45:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641261975] [2024-10-24 00:45:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:45:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:45:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 00:45:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 00:45:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 00:45:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 00:45:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:45:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641261975] [2024-10-24 00:45:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641261975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:45:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087124558] [2024-10-24 00:45:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:45:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:45:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:45:57,861 INFO L87 Difference]: Start difference. First operand 2457 states and 4100 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:59,653 INFO L93 Difference]: Finished difference Result 5908 states and 9969 transitions. [2024-10-24 00:45:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:45:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2024-10-24 00:45:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:59,675 INFO L225 Difference]: With dead ends: 5908 [2024-10-24 00:45:59,675 INFO L226 Difference]: Without dead ends: 3789 [2024-10-24 00:45:59,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:59,685 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1492 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:59,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1130 Invalid, 2373 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [648 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:45:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2024-10-24 00:45:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3662. [2024-10-24 00:45:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 3052 states have (on average 1.6500655307994758) internal successors, (5036), 3137 states have internal predecessors, (5036), 562 states have call successors, (562), 43 states have call predecessors, (562), 47 states have return successors, (569), 562 states have call predecessors, (569), 561 states have call successors, (569) [2024-10-24 00:45:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 6167 transitions. [2024-10-24 00:45:59,868 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 6167 transitions. Word has length 162 [2024-10-24 00:45:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:59,868 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 6167 transitions. [2024-10-24 00:45:59,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:45:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 6167 transitions. [2024-10-24 00:45:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 00:45:59,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:59,886 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 00:45:59,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:59,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1363527751, now seen corresponding path program 1 times [2024-10-24 00:45:59,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686157505] [2024-10-24 00:45:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:45:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:45:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:45:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:45:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:45:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:45:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:45:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:45:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:46:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 00:46:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 00:46:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 00:46:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 00:46:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686157505] [2024-10-24 00:46:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686157505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:00,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:00,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624511318] [2024-10-24 00:46:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:00,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:00,031 INFO L87 Difference]: Start difference. First operand 3662 states and 6167 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:01,752 INFO L93 Difference]: Finished difference Result 8808 states and 14974 transitions. [2024-10-24 00:46:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:01,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 00:46:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:01,782 INFO L225 Difference]: With dead ends: 8808 [2024-10-24 00:46:01,782 INFO L226 Difference]: Without dead ends: 5733 [2024-10-24 00:46:01,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:01,793 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 1482 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:01,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1134 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:46:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2024-10-24 00:46:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5606. [2024-10-24 00:46:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 4751 states have (on average 1.6583877078509788) internal successors, (7879), 4880 states have internal predecessors, (7879), 807 states have call successors, (807), 43 states have call predecessors, (807), 47 states have return successors, (814), 807 states have call predecessors, (814), 806 states have call successors, (814) [2024-10-24 00:46:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 9500 transitions. [2024-10-24 00:46:02,015 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 9500 transitions. Word has length 163 [2024-10-24 00:46:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:02,016 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 9500 transitions. [2024-10-24 00:46:02,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 9500 transitions. [2024-10-24 00:46:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 00:46:02,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:02,040 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:46:02,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:02,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:02,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1924471801, now seen corresponding path program 1 times [2024-10-24 00:46:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409171475] [2024-10-24 00:46:02,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:46:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:46:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 00:46:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 00:46:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 00:46:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 00:46:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409171475] [2024-10-24 00:46:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409171475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:02,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:02,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480065133] [2024-10-24 00:46:02,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:02,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:02,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:02,181 INFO L87 Difference]: Start difference. First operand 5606 states and 9500 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:03,872 INFO L93 Difference]: Finished difference Result 13677 states and 23345 transitions. [2024-10-24 00:46:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2024-10-24 00:46:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:03,921 INFO L225 Difference]: With dead ends: 13677 [2024-10-24 00:46:03,922 INFO L226 Difference]: Without dead ends: 9025 [2024-10-24 00:46:03,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:03,944 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1471 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:03,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1132 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:46:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9025 states. [2024-10-24 00:46:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9025 to 8898. [2024-10-24 00:46:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 7550 states have (on average 1.6574834437086092) internal successors, (12514), 7757 states have internal predecessors, (12514), 1300 states have call successors, (1300), 43 states have call predecessors, (1300), 47 states have return successors, (1307), 1300 states have call predecessors, (1307), 1299 states have call successors, (1307) [2024-10-24 00:46:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 15121 transitions. [2024-10-24 00:46:04,413 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 15121 transitions. Word has length 164 [2024-10-24 00:46:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:04,414 INFO L471 AbstractCegarLoop]: Abstraction has 8898 states and 15121 transitions. [2024-10-24 00:46:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 15121 transitions. [2024-10-24 00:46:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 00:46:04,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:04,456 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:46:04,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1061342605, now seen corresponding path program 1 times [2024-10-24 00:46:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908490674] [2024-10-24 00:46:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:46:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:46:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 00:46:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 00:46:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 00:46:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 00:46:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908490674] [2024-10-24 00:46:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908490674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:04,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:04,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093414446] [2024-10-24 00:46:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:04,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:04,607 INFO L87 Difference]: Start difference. First operand 8898 states and 15121 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:06,369 INFO L93 Difference]: Finished difference Result 22374 states and 38316 transitions. [2024-10-24 00:46:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2024-10-24 00:46:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:06,432 INFO L225 Difference]: With dead ends: 22374 [2024-10-24 00:46:06,432 INFO L226 Difference]: Without dead ends: 14910 [2024-10-24 00:46:06,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:06,469 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1485 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:06,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1138 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:46:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14910 states. [2024-10-24 00:46:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14910 to 14783. [2024-10-24 00:46:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14783 states, 12613 states have (on average 1.6609054150479663) internal successors, (20949), 12964 states have internal predecessors, (20949), 2122 states have call successors, (2122), 43 states have call predecessors, (2122), 47 states have return successors, (2129), 2122 states have call predecessors, (2129), 2121 states have call successors, (2129) [2024-10-24 00:46:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14783 states to 14783 states and 25200 transitions. [2024-10-24 00:46:07,114 INFO L78 Accepts]: Start accepts. Automaton has 14783 states and 25200 transitions. Word has length 165 [2024-10-24 00:46:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 14783 states and 25200 transitions. [2024-10-24 00:46:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14783 states and 25200 transitions. [2024-10-24 00:46:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 00:46:07,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:07,168 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:46:07,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2071399907, now seen corresponding path program 1 times [2024-10-24 00:46:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518858803] [2024-10-24 00:46:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:46:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:46:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 00:46:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 00:46:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 00:46:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 00:46:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:07,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518858803] [2024-10-24 00:46:07,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518858803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:07,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:07,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:07,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227755755] [2024-10-24 00:46:07,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:07,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:07,297 INFO L87 Difference]: Start difference. First operand 14783 states and 25200 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:09,325 INFO L93 Difference]: Finished difference Result 35666 states and 60811 transitions. [2024-10-24 00:46:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 166 [2024-10-24 00:46:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:09,420 INFO L225 Difference]: With dead ends: 35666 [2024-10-24 00:46:09,421 INFO L226 Difference]: Without dead ends: 23426 [2024-10-24 00:46:09,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:09,463 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1466 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:09,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1120 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:46:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23426 states. [2024-10-24 00:46:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 23299. [2024-10-24 00:46:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23299 states, 19926 states have (on average 1.645337749673793) internal successors, (32785), 20551 states have internal predecessors, (32785), 3325 states have call successors, (3325), 43 states have call predecessors, (3325), 47 states have return successors, (3332), 3325 states have call predecessors, (3332), 3324 states have call successors, (3332) [2024-10-24 00:46:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23299 states to 23299 states and 39442 transitions. [2024-10-24 00:46:10,523 INFO L78 Accepts]: Start accepts. Automaton has 23299 states and 39442 transitions. Word has length 166 [2024-10-24 00:46:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:10,524 INFO L471 AbstractCegarLoop]: Abstraction has 23299 states and 39442 transitions. [2024-10-24 00:46:10,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23299 states and 39442 transitions. [2024-10-24 00:46:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 00:46:10,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:10,607 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:46:10,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1383331988, now seen corresponding path program 1 times [2024-10-24 00:46:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:10,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769972980] [2024-10-24 00:46:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:46:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:46:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:46:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 00:46:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 00:46:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 00:46:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769972980] [2024-10-24 00:46:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769972980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483567295] [2024-10-24 00:46:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:10,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:10,744 INFO L87 Difference]: Start difference. First operand 23299 states and 39442 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:13,154 INFO L93 Difference]: Finished difference Result 61518 states and 104470 transitions. [2024-10-24 00:46:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 167 [2024-10-24 00:46:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:13,330 INFO L225 Difference]: With dead ends: 61518 [2024-10-24 00:46:13,330 INFO L226 Difference]: Without dead ends: 41545 [2024-10-24 00:46:13,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:13,399 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1459 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:13,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1139 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:46:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41545 states. [2024-10-24 00:46:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41545 to 41418. [2024-10-24 00:46:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41418 states, 35595 states have (on average 1.6413822166034555) internal successors, (58425), 36486 states have internal predecessors, (58425), 5775 states have call successors, (5775), 43 states have call predecessors, (5775), 47 states have return successors, (5782), 5775 states have call predecessors, (5782), 5774 states have call successors, (5782) [2024-10-24 00:46:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41418 states to 41418 states and 69982 transitions. [2024-10-24 00:46:15,052 INFO L78 Accepts]: Start accepts. Automaton has 41418 states and 69982 transitions. Word has length 167 [2024-10-24 00:46:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:15,053 INFO L471 AbstractCegarLoop]: Abstraction has 41418 states and 69982 transitions. [2024-10-24 00:46:15,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41418 states and 69982 transitions. [2024-10-24 00:46:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 00:46:15,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:15,510 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:46:15,511 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 505055184, now seen corresponding path program 1 times [2024-10-24 00:46:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072542123] [2024-10-24 00:46:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:46:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:46:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 00:46:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 00:46:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 00:46:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 00:46:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:15,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:15,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072542123] [2024-10-24 00:46:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072542123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:15,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:15,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527455936] [2024-10-24 00:46:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:15,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:15,707 INFO L87 Difference]: Start difference. First operand 41418 states and 69982 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:18,976 INFO L93 Difference]: Finished difference Result 112215 states and 190387 transitions. [2024-10-24 00:46:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-10-24 00:46:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:19,255 INFO L225 Difference]: With dead ends: 112215 [2024-10-24 00:46:19,255 INFO L226 Difference]: Without dead ends: 75266 [2024-10-24 00:46:19,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:19,350 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 1456 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:19,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1124 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:46:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75266 states. [2024-10-24 00:46:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75266 to 75139. [2024-10-24 00:46:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75139 states, 64803 states have (on average 1.6410505686465133) internal successors, (106345), 66483 states have internal predecessors, (106345), 10288 states have call successors, (10288), 43 states have call predecessors, (10288), 47 states have return successors, (10295), 10288 states have call predecessors, (10295), 10287 states have call successors, (10295) [2024-10-24 00:46:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75139 states to 75139 states and 126928 transitions. [2024-10-24 00:46:22,414 INFO L78 Accepts]: Start accepts. Automaton has 75139 states and 126928 transitions. Word has length 168 [2024-10-24 00:46:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:22,415 INFO L471 AbstractCegarLoop]: Abstraction has 75139 states and 126928 transitions. [2024-10-24 00:46:22,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 75139 states and 126928 transitions. [2024-10-24 00:46:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 00:46:23,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:23,154 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:46:23,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2043330335, now seen corresponding path program 1 times [2024-10-24 00:46:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294082161] [2024-10-24 00:46:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:46:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:46:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 00:46:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 00:46:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 00:46:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 00:46:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:46:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294082161] [2024-10-24 00:46:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294082161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:23,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:23,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:46:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348448198] [2024-10-24 00:46:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:23,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:46:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:46:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:46:23,289 INFO L87 Difference]: Start difference. First operand 75139 states and 126928 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:27,331 INFO L93 Difference]: Finished difference Result 140399 states and 237261 transitions. [2024-10-24 00:46:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:46:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 169 [2024-10-24 00:46:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:27,856 INFO L225 Difference]: With dead ends: 140399 [2024-10-24 00:46:27,856 INFO L226 Difference]: Without dead ends: 140089 [2024-10-24 00:46:27,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:46:27,898 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1465 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:27,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1145 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:46:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140089 states. [2024-10-24 00:46:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140089 to 139962. [2024-10-24 00:46:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139962 states, 121258 states have (on average 1.634407626713289) internal successors, (198185), 123461 states have internal predecessors, (198185), 18656 states have call successors, (18656), 43 states have call predecessors, (18656), 47 states have return successors, (18663), 18656 states have call predecessors, (18663), 18655 states have call successors, (18663) [2024-10-24 00:46:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139962 states to 139962 states and 235504 transitions. [2024-10-24 00:46:32,788 INFO L78 Accepts]: Start accepts. Automaton has 139962 states and 235504 transitions. Word has length 169 [2024-10-24 00:46:32,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:32,789 INFO L471 AbstractCegarLoop]: Abstraction has 139962 states and 235504 transitions. [2024-10-24 00:46:32,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 00:46:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 139962 states and 235504 transitions. [2024-10-24 00:46:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 00:46:32,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:32,990 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:46:32,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__ForwardErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:32,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1197605400, now seen corresponding path program 1 times [2024-10-24 00:46:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167007155] [2024-10-24 00:46:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:46:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-24 00:46:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:46:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 00:46:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 00:46:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:46:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:46:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:46:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:46:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:46:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:46:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 00:46:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 00:46:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 00:46:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 00:46:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 00:46:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167007155] [2024-10-24 00:46:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167007155] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348311466] [2024-10-24 00:46:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:34,306 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:34,307 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:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:34,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 00:46:34,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 00:46:35,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:46:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348311466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:35,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:46:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [28] total 46 [2024-10-24 00:46:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304434935] [2024-10-24 00:46:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:35,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 00:46:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 00:46:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1960, Unknown=0, NotChecked=0, Total=2070 [2024-10-24 00:46:35,656 INFO L87 Difference]: Start difference. First operand 139962 states and 235504 transitions. Second operand has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 15 states have internal predecessors, (110), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21)