./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_spec3_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_spec3_product13.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1a514ed3c88dbb6b86d895b5ccbc4ee84ef064cf150167d71ca780388d60956 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:28:57,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:28:57,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:28:57,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:28:57,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:28:57,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:28:57,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:28:57,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:28:57,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:28:57,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:28:57,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:28:57,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:28:57,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:28:57,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:28:57,665 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:28:57,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:28:57,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:28:57,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:28:57,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:28:57,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:28:57,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:28:57,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:28:57,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:28:57,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:28:57,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:28:57,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:28:57,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:28:57,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:28:57,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:28:57,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:28:57,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:28:57,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:28:57,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:28:57,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:28:57,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:28:57,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:28:57,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:28:57,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:28:57,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:28:57,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:28:57,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:28:57,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:28:57,674 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 -> c1a514ed3c88dbb6b86d895b5ccbc4ee84ef064cf150167d71ca780388d60956 [2024-10-12 19:28:57,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:28:57,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:28:57,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:28:57,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:28:57,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:28:57,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product13.cil.c [2024-10-12 19:28:59,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:28:59,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:28:59,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product13.cil.c [2024-10-12 19:28:59,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb1c4ca9/658a6e5d3d2c4b1ca42749f51814ebfa/FLAG04d1b0295 [2024-10-12 19:28:59,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb1c4ca9/658a6e5d3d2c4b1ca42749f51814ebfa [2024-10-12 19:28:59,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:28:59,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:28:59,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:28:59,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:28:59,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:28:59,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:28:59,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f87bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59, skipping insertion in model container [2024-10-12 19:28:59,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:28:59,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:28:59,820 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_spec3_product13.cil.c[62004,62017] [2024-10-12 19:28:59,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:28:59,835 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:28:59,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-12 19:28:59,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [97] [2024-10-12 19:28:59,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [163] [2024-10-12 19:28:59,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [384] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [662] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1071] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1330] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1427] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1793] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2862] [2024-10-12 19:28:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2871] [2024-10-12 19:28:59,941 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_spec3_product13.cil.c[62004,62017] [2024-10-12 19:28:59,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:28:59,968 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:28:59,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59 WrapperNode [2024-10-12 19:28:59,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:28:59,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:28:59,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:28:59,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:28:59,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:28:59,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,037 INFO L138 Inliner]: procedures = 125, calls = 184, calls flagged for inlining = 52, calls inlined = 43, statements flattened = 827 [2024-10-12 19:29:00,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:29:00,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:29:00,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:29:00,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:29:00,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,079 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-12 19:29:00,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:29:00,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:29:00,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:29:00,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:29:00,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (1/1) ... [2024-10-12 19:29:00,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:29:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:00,174 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-12 19:29:00,179 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-12 19:29:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-12 19:29:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-12 19:29:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-12 19:29:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-12 19:29:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-12 19:29:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-12 19:29:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-12 19:29:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-12 19:29:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-12 19:29:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-12 19:29:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-12 19:29:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-12 19:29:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-12 19:29:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-12 19:29:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-12 19:29:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-12 19:29:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:29:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-12 19:29:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-12 19:29:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-12 19:29:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-12 19:29:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-12 19:29:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-12 19:29:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:29:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:29:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-12 19:29:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-12 19:29:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-12 19:29:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-12 19:29:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-12 19:29:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-12 19:29:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:29:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:29:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-12 19:29:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-12 19:29:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:29:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:29:00,381 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:29:00,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:29:00,974 INFO L? ?]: Removed 362 outVars from TransFormulas that were not future-live. [2024-10-12 19:29:00,974 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:29:01,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:29:01,014 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:29:01,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:29:01 BoogieIcfgContainer [2024-10-12 19:29:01,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:29:01,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:29:01,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:29:01,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:29:01,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:28:59" (1/3) ... [2024-10-12 19:29:01,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dee80ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:29:01, skipping insertion in model container [2024-10-12 19:29:01,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:28:59" (2/3) ... [2024-10-12 19:29:01,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dee80ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:29:01, skipping insertion in model container [2024-10-12 19:29:01,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:29:01" (3/3) ... [2024-10-12 19:29:01,024 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product13.cil.c [2024-10-12 19:29:01,035 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:29:01,035 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:29:01,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:29:01,099 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;@4645abac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:29:01,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:29:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 200 states have (on average 1.6) internal successors, (320), 204 states have internal predecessors, (320), 43 states have call successors, (43), 18 states have call predecessors, (43), 18 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-12 19:29:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 19:29:01,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:01,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:01,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:01,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash -996526215, now seen corresponding path program 1 times [2024-10-12 19:29:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:01,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160905317] [2024-10-12 19:29:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:29:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:29:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:29:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:29:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:29:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:29:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160905317] [2024-10-12 19:29:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160905317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392931390] [2024-10-12 19:29:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:01,727 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-12 19:29:01,728 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-12 19:29:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:01,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 19:29:01,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:29:02,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392931390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:02,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-12 19:29:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27803282] [2024-10-12 19:29:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:02,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:29:02,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:29:02,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:29:02,053 INFO L87 Difference]: Start difference. First operand has 263 states, 200 states have (on average 1.6) internal successors, (320), 204 states have internal predecessors, (320), 43 states have call successors, (43), 18 states have call predecessors, (43), 18 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:02,108 INFO L93 Difference]: Finished difference Result 384 states and 582 transitions. [2024-10-12 19:29:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:29:02,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2024-10-12 19:29:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:02,118 INFO L225 Difference]: With dead ends: 384 [2024-10-12 19:29:02,119 INFO L226 Difference]: Without dead ends: 259 [2024-10-12 19:29:02,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:29:02,124 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:02,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:29:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-12 19:29:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-12 19:29:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 200 states have internal predecessors, (313), 43 states have call successors, (43), 18 states have call predecessors, (43), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 19:29:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 396 transitions. [2024-10-12 19:29:02,173 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 396 transitions. Word has length 93 [2024-10-12 19:29:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 396 transitions. [2024-10-12 19:29:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2024-10-12 19:29:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:29:02,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:02,181 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:02,195 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-12 19:29:02,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-12 19:29:02,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:02,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1611093847, now seen corresponding path program 1 times [2024-10-12 19:29:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434816655] [2024-10-12 19:29:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:29:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:29:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:29:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:29:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:29:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:29:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:02,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434816655] [2024-10-12 19:29:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434816655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:02,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082556848] [2024-10-12 19:29:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:02,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:02,601 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-12 19:29:02,602 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-12 19:29:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:02,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:29:02,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:29:02,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082556848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:02,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:02,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:29:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752203894] [2024-10-12 19:29:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:02,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:29:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:29:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:02,879 INFO L87 Difference]: Start difference. First operand 259 states and 396 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:02,931 INFO L93 Difference]: Finished difference Result 379 states and 565 transitions. [2024-10-12 19:29:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:29:02,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-12 19:29:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:02,934 INFO L225 Difference]: With dead ends: 379 [2024-10-12 19:29:02,935 INFO L226 Difference]: Without dead ends: 261 [2024-10-12 19:29:02,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:02,938 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:02,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 771 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:29:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-12 19:29:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-10-12 19:29:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 200 states have (on average 1.575) internal successors, (315), 202 states have internal predecessors, (315), 43 states have call successors, (43), 18 states have call predecessors, (43), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 19:29:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 398 transitions. [2024-10-12 19:29:02,958 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 398 transitions. Word has length 94 [2024-10-12 19:29:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:02,958 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 398 transitions. [2024-10-12 19:29:02,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 398 transitions. [2024-10-12 19:29:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 19:29:02,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:02,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:02,976 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-12 19:29:03,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-12 19:29:03,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:03,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash -873720405, now seen corresponding path program 1 times [2024-10-12 19:29:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:03,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172810995] [2024-10-12 19:29:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:29:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:29:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:29:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:29:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:29:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172810995] [2024-10-12 19:29:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172810995] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924426872] [2024-10-12 19:29:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:03,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:03,378 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-12 19:29:03,380 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-12 19:29:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:03,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:29:03,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:29:03,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924426872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:29:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666090595] [2024-10-12 19:29:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:03,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:29:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:29:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:03,618 INFO L87 Difference]: Start difference. First operand 261 states and 398 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:03,674 INFO L93 Difference]: Finished difference Result 548 states and 848 transitions. [2024-10-12 19:29:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:29:03,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-12 19:29:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:03,679 INFO L225 Difference]: With dead ends: 548 [2024-10-12 19:29:03,680 INFO L226 Difference]: Without dead ends: 309 [2024-10-12 19:29:03,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:03,682 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 95 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:03,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 738 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:29:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-12 19:29:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2024-10-12 19:29:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.5862068965517242) internal successors, (368), 234 states have internal predecessors, (368), 54 states have call successors, (54), 18 states have call predecessors, (54), 17 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-12 19:29:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 473 transitions. [2024-10-12 19:29:03,703 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 473 transitions. Word has length 99 [2024-10-12 19:29:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:03,703 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 473 transitions. [2024-10-12 19:29:03,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 473 transitions. [2024-10-12 19:29:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 19:29:03,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:03,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:03,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:29:03,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:03,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:03,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2040336647, now seen corresponding path program 1 times [2024-10-12 19:29:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:03,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201765005] [2024-10-12 19:29:03,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:29:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:29:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:29:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:29:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:29:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:29:04,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201765005] [2024-10-12 19:29:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201765005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442651420] [2024-10-12 19:29:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:04,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:04,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:04,080 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-12 19:29:04,081 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-12 19:29:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:29:04,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:29:04,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442651420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:04,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-12 19:29:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143682192] [2024-10-12 19:29:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:29:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:04,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:29:04,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:29:04,347 INFO L87 Difference]: Start difference. First operand 304 states and 473 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:04,438 INFO L93 Difference]: Finished difference Result 603 states and 940 transitions. [2024-10-12 19:29:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:29:04,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-12 19:29:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:04,443 INFO L225 Difference]: With dead ends: 603 [2024-10-12 19:29:04,444 INFO L226 Difference]: Without dead ends: 306 [2024-10-12 19:29:04,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:29:04,445 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:04,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1501 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:29:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-12 19:29:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-12 19:29:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 233 states have (on average 1.5836909871244635) internal successors, (369), 236 states have internal predecessors, (369), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) [2024-10-12 19:29:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 476 transitions. [2024-10-12 19:29:04,467 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 476 transitions. Word has length 100 [2024-10-12 19:29:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:04,468 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 476 transitions. [2024-10-12 19:29:04,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 476 transitions. [2024-10-12 19:29:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:29:04,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:04,470 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:04,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 19:29:04,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:04,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:04,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:04,671 INFO L85 PathProgramCache]: Analyzing trace with hash -879021776, now seen corresponding path program 1 times [2024-10-12 19:29:04,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:04,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983797002] [2024-10-12 19:29:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:29:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:29:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:29:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:29:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:29:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:29:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:29:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 19:29:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983797002] [2024-10-12 19:29:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983797002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237070340] [2024-10-12 19:29:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:04,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:04,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:29:04,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:29:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:29:05,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:29:05,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237070340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:05,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:05,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-12 19:29:05,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841685515] [2024-10-12 19:29:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:05,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:29:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:29:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:29:05,108 INFO L87 Difference]: Start difference. First operand 306 states and 476 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:05,181 INFO L93 Difference]: Finished difference Result 605 states and 945 transitions. [2024-10-12 19:29:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:29:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2024-10-12 19:29:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:05,185 INFO L225 Difference]: With dead ends: 605 [2024-10-12 19:29:05,185 INFO L226 Difference]: Without dead ends: 308 [2024-10-12 19:29:05,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:29:05,187 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:05,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1487 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:29:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-12 19:29:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-12 19:29:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 238 states have internal predecessors, (370), 54 states have call successors, (54), 18 states have call predecessors, (54), 19 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2024-10-12 19:29:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 482 transitions. [2024-10-12 19:29:05,203 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 482 transitions. Word has length 101 [2024-10-12 19:29:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 482 transitions. [2024-10-12 19:29:05,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 482 transitions. [2024-10-12 19:29:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 19:29:05,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:05,204 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:05,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:29:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:05,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 88389875, now seen corresponding path program 1 times [2024-10-12 19:29:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746823148] [2024-10-12 19:29:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:29:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:29:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:29:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:29:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:29:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:29:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:29:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:29:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746823148] [2024-10-12 19:29:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746823148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:05,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:05,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:29:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988281022] [2024-10-12 19:29:05,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:29:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:05,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:29:05,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:29:05,559 INFO L87 Difference]: Start difference. First operand 308 states and 482 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:06,619 INFO L93 Difference]: Finished difference Result 652 states and 1027 transitions. [2024-10-12 19:29:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:29:06,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2024-10-12 19:29:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:06,622 INFO L225 Difference]: With dead ends: 652 [2024-10-12 19:29:06,622 INFO L226 Difference]: Without dead ends: 363 [2024-10-12 19:29:06,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:29:06,623 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 614 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:06,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 817 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:29:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-12 19:29:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 308. [2024-10-12 19:29:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 234 states have (on average 1.5811965811965811) internal successors, (370), 238 states have internal predecessors, (370), 54 states have call successors, (54), 18 states have call predecessors, (54), 19 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2024-10-12 19:29:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 481 transitions. [2024-10-12 19:29:06,642 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 481 transitions. Word has length 102 [2024-10-12 19:29:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 481 transitions. [2024-10-12 19:29:06,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 481 transitions. [2024-10-12 19:29:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:29:06,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:06,644 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:29:06,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1552080190, now seen corresponding path program 2 times [2024-10-12 19:29:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272757932] [2024-10-12 19:29:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:29:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:29:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:29:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:29:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:29:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:29:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:29:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272757932] [2024-10-12 19:29:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272757932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:06,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:06,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:29:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645842102] [2024-10-12 19:29:06,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:06,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:29:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:06,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:29:06,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:29:06,780 INFO L87 Difference]: Start difference. First operand 308 states and 481 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:07,777 INFO L93 Difference]: Finished difference Result 654 states and 1030 transitions. [2024-10-12 19:29:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:29:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-12 19:29:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:07,779 INFO L225 Difference]: With dead ends: 654 [2024-10-12 19:29:07,779 INFO L226 Difference]: Without dead ends: 365 [2024-10-12 19:29:07,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:29:07,781 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 611 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:07,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 817 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:29:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-12 19:29:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 310. [2024-10-12 19:29:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 235 states have (on average 1.578723404255319) internal successors, (371), 240 states have internal predecessors, (371), 54 states have call successors, (54), 18 states have call predecessors, (54), 20 states have return successors, (59), 51 states have call predecessors, (59), 51 states have call successors, (59) [2024-10-12 19:29:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 484 transitions. [2024-10-12 19:29:07,798 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 484 transitions. Word has length 103 [2024-10-12 19:29:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:07,798 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 484 transitions. [2024-10-12 19:29:07,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 484 transitions. [2024-10-12 19:29:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 19:29:07,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:07,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:29:07,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2021575342, now seen corresponding path program 1 times [2024-10-12 19:29:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132850361] [2024-10-12 19:29:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:29:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:29:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:29:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:29:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:29:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:29:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 19:29:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132850361] [2024-10-12 19:29:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132850361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:07,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:07,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:29:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011719226] [2024-10-12 19:29:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:07,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:29:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:29:07,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:29:07,951 INFO L87 Difference]: Start difference. First operand 310 states and 484 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 19:29:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:09,282 INFO L93 Difference]: Finished difference Result 652 states and 1025 transitions. [2024-10-12 19:29:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:29:09,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2024-10-12 19:29:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:09,285 INFO L225 Difference]: With dead ends: 652 [2024-10-12 19:29:09,285 INFO L226 Difference]: Without dead ends: 365 [2024-10-12 19:29:09,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:29:09,287 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 614 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:09,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1174 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:29:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-12 19:29:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 310. [2024-10-12 19:29:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 235 states have (on average 1.578723404255319) internal successors, (371), 240 states have internal predecessors, (371), 54 states have call successors, (54), 18 states have call predecessors, (54), 20 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2024-10-12 19:29:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 483 transitions. [2024-10-12 19:29:09,302 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 483 transitions. Word has length 104 [2024-10-12 19:29:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:09,302 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 483 transitions. [2024-10-12 19:29:09,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 19:29:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 483 transitions. [2024-10-12 19:29:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 19:29:09,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:09,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:09,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:29:09,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:09,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1663563123, now seen corresponding path program 2 times [2024-10-12 19:29:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:09,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426212996] [2024-10-12 19:29:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:29:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:29:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:29:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:29:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:29:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 19:29:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426212996] [2024-10-12 19:29:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426212996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:29:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867105999] [2024-10-12 19:29:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:29:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:29:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:29:09,489 INFO L87 Difference]: Start difference. First operand 310 states and 483 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 19:29:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:10,799 INFO L93 Difference]: Finished difference Result 654 states and 1031 transitions. [2024-10-12 19:29:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:29:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2024-10-12 19:29:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:10,802 INFO L225 Difference]: With dead ends: 654 [2024-10-12 19:29:10,802 INFO L226 Difference]: Without dead ends: 367 [2024-10-12 19:29:10,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:29:10,803 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 611 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:10,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1175 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:29:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-12 19:29:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 312. [2024-10-12 19:29:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 236 states have (on average 1.576271186440678) internal successors, (372), 242 states have internal predecessors, (372), 54 states have call successors, (54), 18 states have call predecessors, (54), 21 states have return successors, (63), 51 states have call predecessors, (63), 51 states have call successors, (63) [2024-10-12 19:29:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 489 transitions. [2024-10-12 19:29:10,820 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 489 transitions. Word has length 105 [2024-10-12 19:29:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:10,821 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 489 transitions. [2024-10-12 19:29:10,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 19:29:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 489 transitions. [2024-10-12 19:29:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 19:29:10,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:10,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:10,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:29:10,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:10,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash -527315991, now seen corresponding path program 1 times [2024-10-12 19:29:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35806140] [2024-10-12 19:29:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:29:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:29:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:29:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:29:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35806140] [2024-10-12 19:29:10,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35806140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952603444] [2024-10-12 19:29:10,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:10,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:29:10,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 19:29:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:11,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:29:11,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:11,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:29:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952603444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:29:11,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:29:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-12 19:29:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984736700] [2024-10-12 19:29:11,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:29:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:29:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:29:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:11,250 INFO L87 Difference]: Start difference. First operand 312 states and 489 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 19:29:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:12,323 INFO L93 Difference]: Finished difference Result 795 states and 1316 transitions. [2024-10-12 19:29:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:29:12,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 106 [2024-10-12 19:29:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:12,327 INFO L225 Difference]: With dead ends: 795 [2024-10-12 19:29:12,327 INFO L226 Difference]: Without dead ends: 677 [2024-10-12 19:29:12,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 233 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-12 19:29:12,328 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 889 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:12,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1041 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:29:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-12 19:29:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 607. [2024-10-12 19:29:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 467 states have (on average 1.63169164882227) internal successors, (762), 473 states have internal predecessors, (762), 118 states have call successors, (118), 18 states have call predecessors, (118), 21 states have return successors, (137), 115 states have call predecessors, (137), 115 states have call successors, (137) [2024-10-12 19:29:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1017 transitions. [2024-10-12 19:29:12,360 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1017 transitions. Word has length 106 [2024-10-12 19:29:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:12,361 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 1017 transitions. [2024-10-12 19:29:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 19:29:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1017 transitions. [2024-10-12 19:29:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 19:29:12,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:12,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:12,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 19:29:12,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:12,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:12,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -979870324, now seen corresponding path program 1 times [2024-10-12 19:29:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377299310] [2024-10-12 19:29:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:29:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:29:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:29:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:29:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:12,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377299310] [2024-10-12 19:29:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377299310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012545814] [2024-10-12 19:29:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:12,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:12,639 INFO L87 Difference]: Start difference. First operand 607 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:13,348 INFO L93 Difference]: Finished difference Result 1506 states and 2585 transitions. [2024-10-12 19:29:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-12 19:29:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:13,353 INFO L225 Difference]: With dead ends: 1506 [2024-10-12 19:29:13,353 INFO L226 Difference]: Without dead ends: 959 [2024-10-12 19:29:13,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-12 19:29:13,355 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 703 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:13,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 609 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-12 19:29:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 899. [2024-10-12 19:29:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 695 states have (on average 1.6388489208633092) internal successors, (1139), 701 states have internal predecessors, (1139), 182 states have call successors, (182), 18 states have call predecessors, (182), 21 states have return successors, (211), 179 states have call predecessors, (211), 179 states have call successors, (211) [2024-10-12 19:29:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1532 transitions. [2024-10-12 19:29:13,394 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1532 transitions. Word has length 112 [2024-10-12 19:29:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:13,395 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1532 transitions. [2024-10-12 19:29:13,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1532 transitions. [2024-10-12 19:29:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 19:29:13,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:13,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:13,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:29:13,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:13,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash -589861431, now seen corresponding path program 1 times [2024-10-12 19:29:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:13,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871385721] [2024-10-12 19:29:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:29:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:29:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:29:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:29:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:29:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871385721] [2024-10-12 19:29:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871385721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561468020] [2024-10-12 19:29:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:13,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:13,468 INFO L87 Difference]: Start difference. First operand 899 states and 1532 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:14,151 INFO L93 Difference]: Finished difference Result 2203 states and 3812 transitions. [2024-10-12 19:29:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:14,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-10-12 19:29:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:14,157 INFO L225 Difference]: With dead ends: 2203 [2024-10-12 19:29:14,157 INFO L226 Difference]: Without dead ends: 1414 [2024-10-12 19:29:14,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-12 19:29:14,159 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 701 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:14,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 577 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-10-12 19:29:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1354. [2024-10-12 19:29:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1055 states have (on average 1.642654028436019) internal successors, (1733), 1061 states have internal predecessors, (1733), 277 states have call successors, (277), 18 states have call predecessors, (277), 21 states have return successors, (306), 274 states have call predecessors, (306), 274 states have call successors, (306) [2024-10-12 19:29:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2316 transitions. [2024-10-12 19:29:14,200 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2316 transitions. Word has length 113 [2024-10-12 19:29:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:14,201 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 2316 transitions. [2024-10-12 19:29:14,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2316 transitions. [2024-10-12 19:29:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 19:29:14,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:14,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:14,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:29:14,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:14,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1251036278, now seen corresponding path program 1 times [2024-10-12 19:29:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:14,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405976760] [2024-10-12 19:29:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:29:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:29:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:29:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:29:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:29:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405976760] [2024-10-12 19:29:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405976760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:14,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:14,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754937419] [2024-10-12 19:29:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:14,282 INFO L87 Difference]: Start difference. First operand 1354 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:14,993 INFO L93 Difference]: Finished difference Result 3221 states and 5624 transitions. [2024-10-12 19:29:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-10-12 19:29:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:15,002 INFO L225 Difference]: With dead ends: 3221 [2024-10-12 19:29:15,002 INFO L226 Difference]: Without dead ends: 2097 [2024-10-12 19:29:15,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:15,006 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 699 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:15,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 570 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2024-10-12 19:29:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2037. [2024-10-12 19:29:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 1615 states have (on average 1.646439628482972) internal successors, (2659), 1621 states have internal predecessors, (2659), 400 states have call successors, (400), 18 states have call predecessors, (400), 21 states have return successors, (445), 397 states have call predecessors, (445), 397 states have call successors, (445) [2024-10-12 19:29:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3504 transitions. [2024-10-12 19:29:15,070 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3504 transitions. Word has length 114 [2024-10-12 19:29:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3504 transitions. [2024-10-12 19:29:15,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3504 transitions. [2024-10-12 19:29:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 19:29:15,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:15,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:15,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:29:15,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1243389800, now seen corresponding path program 1 times [2024-10-12 19:29:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:15,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308361305] [2024-10-12 19:29:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:29:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:29:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:29:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:29:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:29:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:29:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308361305] [2024-10-12 19:29:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308361305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619698162] [2024-10-12 19:29:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:15,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:15,148 INFO L87 Difference]: Start difference. First operand 2037 states and 3504 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:15,806 INFO L93 Difference]: Finished difference Result 4791 states and 8429 transitions. [2024-10-12 19:29:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-12 19:29:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:15,818 INFO L225 Difference]: With dead ends: 4791 [2024-10-12 19:29:15,818 INFO L226 Difference]: Without dead ends: 3181 [2024-10-12 19:29:15,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:15,823 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 697 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:15,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 570 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:29:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2024-10-12 19:29:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3121. [2024-10-12 19:29:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2520 states have (on average 1.6488095238095237) internal successors, (4155), 2526 states have internal predecessors, (4155), 579 states have call successors, (579), 18 states have call predecessors, (579), 21 states have return successors, (650), 576 states have call predecessors, (650), 576 states have call successors, (650) [2024-10-12 19:29:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5384 transitions. [2024-10-12 19:29:15,909 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5384 transitions. Word has length 115 [2024-10-12 19:29:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:15,910 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5384 transitions. [2024-10-12 19:29:15,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5384 transitions. [2024-10-12 19:29:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 19:29:15,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:15,918 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:29:15,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:15,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2069468846, now seen corresponding path program 1 times [2024-10-12 19:29:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704460922] [2024-10-12 19:29:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:29:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:29:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:29:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:29:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:29:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704460922] [2024-10-12 19:29:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704460922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:16,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784172711] [2024-10-12 19:29:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:16,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:16,025 INFO L87 Difference]: Start difference. First operand 3121 states and 5384 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:16,754 INFO L93 Difference]: Finished difference Result 7622 states and 13441 transitions. [2024-10-12 19:29:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-12 19:29:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:16,775 INFO L225 Difference]: With dead ends: 7622 [2024-10-12 19:29:16,775 INFO L226 Difference]: Without dead ends: 5151 [2024-10-12 19:29:16,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:16,782 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 695 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:16,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 598 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2024-10-12 19:29:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 5091. [2024-10-12 19:29:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 4114 states have (on average 1.6397666504618376) internal successors, (6746), 4120 states have internal predecessors, (6746), 955 states have call successors, (955), 18 states have call predecessors, (955), 21 states have return successors, (1070), 952 states have call predecessors, (1070), 952 states have call successors, (1070) [2024-10-12 19:29:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 8771 transitions. [2024-10-12 19:29:16,946 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 8771 transitions. Word has length 116 [2024-10-12 19:29:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 8771 transitions. [2024-10-12 19:29:16,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 8771 transitions. [2024-10-12 19:29:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 19:29:16,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:16,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:29:16,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1806588860, now seen corresponding path program 1 times [2024-10-12 19:29:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366775571] [2024-10-12 19:29:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:29:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:29:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:29:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:29:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:29:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:29:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366775571] [2024-10-12 19:29:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366775571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227653865] [2024-10-12 19:29:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:17,038 INFO L87 Difference]: Start difference. First operand 5091 states and 8771 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:17,757 INFO L93 Difference]: Finished difference Result 12603 states and 22189 transitions. [2024-10-12 19:29:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-10-12 19:29:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:17,805 INFO L225 Difference]: With dead ends: 12603 [2024-10-12 19:29:17,805 INFO L226 Difference]: Without dead ends: 8528 [2024-10-12 19:29:17,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:17,818 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 693 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:17,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 571 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:29:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8528 states. [2024-10-12 19:29:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8528 to 8468. [2024-10-12 19:29:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 6885 states have (on average 1.6367465504720407) internal successors, (11269), 6891 states have internal predecessors, (11269), 1561 states have call successors, (1561), 18 states have call predecessors, (1561), 21 states have return successors, (1754), 1558 states have call predecessors, (1754), 1558 states have call successors, (1754) [2024-10-12 19:29:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 14584 transitions. [2024-10-12 19:29:18,092 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 14584 transitions. Word has length 117 [2024-10-12 19:29:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:18,092 INFO L471 AbstractCegarLoop]: Abstraction has 8468 states and 14584 transitions. [2024-10-12 19:29:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 14584 transitions. [2024-10-12 19:29:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 19:29:18,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:18,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:18,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:29:18,109 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:18,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1711371980, now seen corresponding path program 1 times [2024-10-12 19:29:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:18,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369425009] [2024-10-12 19:29:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:29:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:29:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:29:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:29:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:18,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369425009] [2024-10-12 19:29:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369425009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985328838] [2024-10-12 19:29:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:18,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:18,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:18,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:18,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:18,181 INFO L87 Difference]: Start difference. First operand 8468 states and 14584 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:19,019 INFO L93 Difference]: Finished difference Result 21955 states and 38588 transitions. [2024-10-12 19:29:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-10-12 19:29:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:19,065 INFO L225 Difference]: With dead ends: 21955 [2024-10-12 19:29:19,066 INFO L226 Difference]: Without dead ends: 14912 [2024-10-12 19:29:19,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:19,088 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 691 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:19,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 604 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14912 states. [2024-10-12 19:29:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14912 to 14852. [2024-10-12 19:29:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14852 states, 12066 states have (on average 1.626553953257086) internal successors, (19626), 12072 states have internal predecessors, (19626), 2764 states have call successors, (2764), 18 states have call predecessors, (2764), 21 states have return successors, (3101), 2761 states have call predecessors, (3101), 2761 states have call successors, (3101) [2024-10-12 19:29:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14852 states to 14852 states and 25491 transitions. [2024-10-12 19:29:19,552 INFO L78 Accepts]: Start accepts. Automaton has 14852 states and 25491 transitions. Word has length 118 [2024-10-12 19:29:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:19,552 INFO L471 AbstractCegarLoop]: Abstraction has 14852 states and 25491 transitions. [2024-10-12 19:29:19,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 14852 states and 25491 transitions. [2024-10-12 19:29:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 19:29:19,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:19,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:19,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:29:19,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash -626588093, now seen corresponding path program 1 times [2024-10-12 19:29:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073683949] [2024-10-12 19:29:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:29:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:29:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:29:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:29:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:29:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073683949] [2024-10-12 19:29:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073683949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:19,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245926994] [2024-10-12 19:29:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:19,655 INFO L87 Difference]: Start difference. First operand 14852 states and 25491 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:20,815 INFO L93 Difference]: Finished difference Result 39314 states and 68974 transitions. [2024-10-12 19:29:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-10-12 19:29:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:20,912 INFO L225 Difference]: With dead ends: 39314 [2024-10-12 19:29:20,913 INFO L226 Difference]: Without dead ends: 26479 [2024-10-12 19:29:20,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:20,953 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 689 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:20,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 571 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26479 states. [2024-10-12 19:29:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26479 to 26419. [2024-10-12 19:29:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26419 states, 21594 states have (on average 1.6222561822728536) internal successors, (35031), 21600 states have internal predecessors, (35031), 4803 states have call successors, (4803), 18 states have call predecessors, (4803), 21 states have return successors, (5414), 4800 states have call predecessors, (5414), 4800 states have call successors, (5414) [2024-10-12 19:29:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26419 states to 26419 states and 45248 transitions. [2024-10-12 19:29:21,906 INFO L78 Accepts]: Start accepts. Automaton has 26419 states and 45248 transitions. Word has length 119 [2024-10-12 19:29:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:21,907 INFO L471 AbstractCegarLoop]: Abstraction has 26419 states and 45248 transitions. [2024-10-12 19:29:21,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26419 states and 45248 transitions. [2024-10-12 19:29:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 19:29:21,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:21,929 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:21,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:29:21,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:21,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -366914934, now seen corresponding path program 1 times [2024-10-12 19:29:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:21,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390371924] [2024-10-12 19:29:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:29:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:29:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:29:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:29:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:29:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390371924] [2024-10-12 19:29:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390371924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134244120] [2024-10-12 19:29:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:22,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:22,001 INFO L87 Difference]: Start difference. First operand 26419 states and 45248 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:23,528 INFO L93 Difference]: Finished difference Result 71926 states and 125398 transitions. [2024-10-12 19:29:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:23,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-10-12 19:29:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:23,689 INFO L225 Difference]: With dead ends: 71926 [2024-10-12 19:29:23,690 INFO L226 Difference]: Without dead ends: 48239 [2024-10-12 19:29:23,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:23,756 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 687 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:23,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 576 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:29:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48239 states. [2024-10-12 19:29:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48239 to 48179. [2024-10-12 19:29:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48179 states, 39639 states have (on average 1.616665405282676) internal successors, (64083), 39645 states have internal predecessors, (64083), 8518 states have call successors, (8518), 18 states have call predecessors, (8518), 21 states have return successors, (9661), 8515 states have call predecessors, (9661), 8515 states have call successors, (9661) [2024-10-12 19:29:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48179 states to 48179 states and 82262 transitions. [2024-10-12 19:29:25,428 INFO L78 Accepts]: Start accepts. Automaton has 48179 states and 82262 transitions. Word has length 120 [2024-10-12 19:29:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:25,428 INFO L471 AbstractCegarLoop]: Abstraction has 48179 states and 82262 transitions. [2024-10-12 19:29:25,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 48179 states and 82262 transitions. [2024-10-12 19:29:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:29:25,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:25,453 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:25,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:29:25,454 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:25,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1318894787, now seen corresponding path program 1 times [2024-10-12 19:29:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348930366] [2024-10-12 19:29:25,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:29:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:29:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:29:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:29:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:29:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:29:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348930366] [2024-10-12 19:29:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348930366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:29:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668988273] [2024-10-12 19:29:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:25,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:29:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:29:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:29:25,858 INFO L87 Difference]: Start difference. First operand 48179 states and 82262 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:27,953 INFO L93 Difference]: Finished difference Result 89645 states and 156762 transitions. [2024-10-12 19:29:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:29:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-10-12 19:29:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:28,370 INFO L225 Difference]: With dead ends: 89645 [2024-10-12 19:29:28,370 INFO L226 Difference]: Without dead ends: 89527 [2024-10-12 19:29:28,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-12 19:29:28,397 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 682 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:28,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 582 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:29:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89527 states. [2024-10-12 19:29:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89527 to 89467. [2024-10-12 19:29:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89467 states, 74128 states have (on average 1.6095537448737318) internal successors, (119313), 74134 states have internal predecessors, (119313), 15317 states have call successors, (15317), 18 states have call predecessors, (15317), 21 states have return successors, (17506), 15314 states have call predecessors, (17506), 15314 states have call successors, (17506) [2024-10-12 19:29:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89467 states to 89467 states and 152136 transitions. [2024-10-12 19:29:31,286 INFO L78 Accepts]: Start accepts. Automaton has 89467 states and 152136 transitions. Word has length 121 [2024-10-12 19:29:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:31,286 INFO L471 AbstractCegarLoop]: Abstraction has 89467 states and 152136 transitions. [2024-10-12 19:29:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:29:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 89467 states and 152136 transitions. [2024-10-12 19:29:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 19:29:31,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:31,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:31,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:29:31,355 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:31,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1553317621, now seen corresponding path program 1 times [2024-10-12 19:29:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:31,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662210768] [2024-10-12 19:29:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:29:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:29:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:29:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:29:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662210768] [2024-10-12 19:29:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662210768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:31,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:29:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769977565] [2024-10-12 19:29:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:31,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:29:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:31,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:29:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:31,554 INFO L87 Difference]: Start difference. First operand 89467 states and 152136 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:34,829 INFO L93 Difference]: Finished difference Result 89951 states and 156117 transitions. [2024-10-12 19:29:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 19:29:34,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-10-12 19:29:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:35,087 INFO L225 Difference]: With dead ends: 89951 [2024-10-12 19:29:35,087 INFO L226 Difference]: Without dead ends: 89840 [2024-10-12 19:29:35,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:29:35,114 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1186 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2854 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:35,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 810 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2854 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:29:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89840 states. [2024-10-12 19:29:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89840 to 89693. [2024-10-12 19:29:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89693 states, 74304 states have (on average 1.6092942506459949) internal successors, (119577), 74313 states have internal predecessors, (119577), 15343 states have call successors, (15343), 38 states have call predecessors, (15343), 45 states have return successors, (17537), 15341 states have call predecessors, (17537), 15338 states have call successors, (17537) [2024-10-12 19:29:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89693 states to 89693 states and 152457 transitions. [2024-10-12 19:29:38,007 INFO L78 Accepts]: Start accepts. Automaton has 89693 states and 152457 transitions. Word has length 122 [2024-10-12 19:29:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:38,008 INFO L471 AbstractCegarLoop]: Abstraction has 89693 states and 152457 transitions. [2024-10-12 19:29:38,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:29:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 89693 states and 152457 transitions. [2024-10-12 19:29:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 19:29:38,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:38,036 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:38,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:29:38,037 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:38,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 474895588, now seen corresponding path program 1 times [2024-10-12 19:29:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468971622] [2024-10-12 19:29:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:29:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:29:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:29:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:29:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:38,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468971622] [2024-10-12 19:29:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468971622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:38,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:38,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 19:29:38,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873305684] [2024-10-12 19:29:38,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:38,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 19:29:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:38,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 19:29:38,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:29:38,226 INFO L87 Difference]: Start difference. First operand 89693 states and 152457 transitions. Second operand has 13 states, 11 states have (on average 7.545454545454546) internal successors, (83), 9 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 19:29:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:41,729 INFO L93 Difference]: Finished difference Result 90252 states and 156563 transitions. [2024-10-12 19:29:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:29:41,731 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.545454545454546) internal successors, (83), 9 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 123 [2024-10-12 19:29:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:41,973 INFO L225 Difference]: With dead ends: 90252 [2024-10-12 19:29:41,973 INFO L226 Difference]: Without dead ends: 89822 [2024-10-12 19:29:42,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-10-12 19:29:42,007 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 889 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:42,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1440 Invalid, 4080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 3791 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:29:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89822 states. [2024-10-12 19:29:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89822 to 89687. [2024-10-12 19:29:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89687 states, 74301 states have (on average 1.6092650166215798) internal successors, (119570), 74310 states have internal predecessors, (119570), 15343 states have call successors, (15343), 37 states have call predecessors, (15343), 42 states have return successors, (17536), 15339 states have call predecessors, (17536), 15339 states have call successors, (17536) [2024-10-12 19:29:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89687 states to 89687 states and 152449 transitions. [2024-10-12 19:29:45,028 INFO L78 Accepts]: Start accepts. Automaton has 89687 states and 152449 transitions. Word has length 123 [2024-10-12 19:29:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:45,029 INFO L471 AbstractCegarLoop]: Abstraction has 89687 states and 152449 transitions. [2024-10-12 19:29:45,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.545454545454546) internal successors, (83), 9 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 19:29:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 89687 states and 152449 transitions. [2024-10-12 19:29:45,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 19:29:45,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:45,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:29:45,062 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:45,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 389147649, now seen corresponding path program 1 times [2024-10-12 19:29:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113473265] [2024-10-12 19:29:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:29:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:29:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:29:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-12 19:29:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:45,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113473265] [2024-10-12 19:29:45,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113473265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:45,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711292849] [2024-10-12 19:29:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:45,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:45,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:45,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:29:45,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 19:29:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 19:29:45,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:29:45,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711292849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 28 [2024-10-12 19:29:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76501521] [2024-10-12 19:29:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:29:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:29:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:29:45,790 INFO L87 Difference]: Start difference. First operand 89687 states and 152449 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 10 states have internal predecessors, (93), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 19:29:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:48,134 INFO L93 Difference]: Finished difference Result 90230 states and 153208 transitions. [2024-10-12 19:29:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:29:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 10 states have internal predecessors, (93), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 126 [2024-10-12 19:29:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:48,373 INFO L225 Difference]: With dead ends: 90230 [2024-10-12 19:29:48,373 INFO L226 Difference]: Without dead ends: 90095 [2024-10-12 19:29:48,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=1402, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 19:29:48,407 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 600 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:48,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 3615 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:29:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90095 states. [2024-10-12 19:29:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90095 to 90030. [2024-10-12 19:29:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90030 states, 74565 states have (on average 1.6087976932877355) internal successors, (119960), 74582 states have internal predecessors, (119960), 15388 states have call successors, (15388), 65 states have call predecessors, (15388), 76 states have return successors, (17588), 15382 states have call predecessors, (17588), 15382 states have call successors, (17588) [2024-10-12 19:29:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90030 states to 90030 states and 152936 transitions. [2024-10-12 19:29:51,067 INFO L78 Accepts]: Start accepts. Automaton has 90030 states and 152936 transitions. Word has length 126 [2024-10-12 19:29:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 90030 states and 152936 transitions. [2024-10-12 19:29:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 10 states have internal predecessors, (93), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 19:29:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 90030 states and 152936 transitions. [2024-10-12 19:29:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 19:29:51,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:51,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:51,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 19:29:51,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:51,306 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:51,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 15132293, now seen corresponding path program 1 times [2024-10-12 19:29:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523700947] [2024-10-12 19:29:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:29:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:29:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:29:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:29:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523700947] [2024-10-12 19:29:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523700947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 19:29:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364681370] [2024-10-12 19:29:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:51,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 19:29:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 19:29:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:29:51,482 INFO L87 Difference]: Start difference. First operand 90030 states and 152936 transitions. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 9 states have internal predecessors, (87), 6 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 19:29:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:54,883 INFO L93 Difference]: Finished difference Result 90834 states and 157382 transitions. [2024-10-12 19:29:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:29:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 9 states have internal predecessors, (87), 6 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2024-10-12 19:29:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:55,279 INFO L225 Difference]: With dead ends: 90834 [2024-10-12 19:29:55,280 INFO L226 Difference]: Without dead ends: 90273 [2024-10-12 19:29:55,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-10-12 19:29:55,308 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 813 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 3745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:55,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1440 Invalid, 3745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 3491 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:29:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90273 states.