./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_spec7_product18.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_spec7_product18.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 f70ac21a1decd51d5f9571a5be4450629a9ca28f5aa1158e9564f33ba44bf6ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:33:34,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:33:34,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:33:34,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:33:34,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:33:34,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:33:34,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:33:34,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:33:34,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:33:34,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:33:34,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:33:34,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:33:34,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:33:34,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:33:34,576 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:33:34,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:33:34,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:33:34,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:33:34,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:33:34,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:33:34,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:33:34,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:33:34,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:33:34,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:33:34,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:33:34,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:33:34,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:33:34,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:33:34,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:33:34,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:33:34,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:33:34,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:33:34,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:33:34,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:33:34,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:33:34,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:33:34,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:33:34,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:33:34,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:33:34,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:33:34,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:33:34,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:33:34,588 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 -> f70ac21a1decd51d5f9571a5be4450629a9ca28f5aa1158e9564f33ba44bf6ef [2024-10-12 19:33:34,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:33:34,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:33:34,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:33:34,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:33:34,882 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:33:34,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c [2024-10-12 19:33:36,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:33:36,707 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:33:36,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c [2024-10-12 19:33:36,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4300b15/042ed3d96c5e48dbaa1403b862674609/FLAG61a0b330b [2024-10-12 19:33:36,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4300b15/042ed3d96c5e48dbaa1403b862674609 [2024-10-12 19:33:36,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:33:36,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:33:36,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:33:36,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:33:36,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:33:36,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:33:36" (1/1) ... [2024-10-12 19:33:36,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2f294a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:36, skipping insertion in model container [2024-10-12 19:33:36,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:33:36" (1/1) ... [2024-10-12 19:33:36,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:33:37,299 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_spec7_product18.cil.c[45803,45816] [2024-10-12 19:33:37,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:33:37,407 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:33:37,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-10-12 19:33:37,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [66] [2024-10-12 19:33:37,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2024-10-12 19:33:37,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [481] [2024-10-12 19:33:37,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1561] [2024-10-12 19:33:37,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1973] [2024-10-12 19:33:37,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1982] [2024-10-12 19:33:37,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2274] [2024-10-12 19:33:37,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2373] [2024-10-12 19:33:37,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2658] [2024-10-12 19:33:37,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [2874] [2024-10-12 19:33:37,485 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_spec7_product18.cil.c[45803,45816] [2024-10-12 19:33:37,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:33:37,589 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:33:37,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37 WrapperNode [2024-10-12 19:33:37,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:33:37,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:33:37,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:33:37,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:33:37,597 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:33:37" (1/1) ... [2024-10-12 19:33:37,626 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:33:37" (1/1) ... [2024-10-12 19:33:37,679 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 59, calls inlined = 50, statements flattened = 906 [2024-10-12 19:33:37,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:33:37,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:33:37,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:33:37,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:33:37,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,744 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:33:37,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:33:37,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:33:37,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:33:37,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:33:37,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (1/1) ... [2024-10-12 19:33:37,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:33:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:37,843 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:33:37,853 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:33:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-12 19:33:37,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-12 19:33:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-12 19:33:37,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-12 19:33:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-12 19:33:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-12 19:33:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-12 19:33:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-12 19:33:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-12 19:33:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-12 19:33:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-12 19:33:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-12 19:33:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-12 19:33:37,903 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-12 19:33:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-12 19:33:37,904 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-12 19:33:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:33:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-12 19:33:37,904 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-12 19:33:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-12 19:33:37,904 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-12 19:33:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-12 19:33:37,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-12 19:33:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-12 19:33:37,907 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-12 19:33:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-12 19:33:37,907 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-12 19:33:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-12 19:33:37,907 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-12 19:33:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-12 19:33:37,907 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-12 19:33:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:33:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:33:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:33:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:33:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-12 19:33:37,908 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-12 19:33:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:33:37,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:33:38,132 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:33:38,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:33:38,994 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-10-12 19:33:38,994 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:33:39,071 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:33:39,071 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:33:39,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:33:39 BoogieIcfgContainer [2024-10-12 19:33:39,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:33:39,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:33:39,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:33:39,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:33:39,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:33:36" (1/3) ... [2024-10-12 19:33:39,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd1441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:33:39, skipping insertion in model container [2024-10-12 19:33:39,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:33:37" (2/3) ... [2024-10-12 19:33:39,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd1441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:33:39, skipping insertion in model container [2024-10-12 19:33:39,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:33:39" (3/3) ... [2024-10-12 19:33:39,083 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product18.cil.c [2024-10-12 19:33:39,104 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:33:39,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:33:39,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:33:39,202 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;@6a218962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:33:39,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:33:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 203 states have (on average 1.6157635467980296) internal successors, (328), 205 states have internal predecessors, (328), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-12 19:33:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 19:33:39,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:39,229 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] [2024-10-12 19:33:39,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 828068327, now seen corresponding path program 1 times [2024-10-12 19:33:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114531944] [2024-10-12 19:33:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:33:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:33:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:33:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:33:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:33:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:33:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:33:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:33:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,093 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:33:40,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:40,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114531944] [2024-10-12 19:33:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114531944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:33:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112508710] [2024-10-12 19:33:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:40,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:40,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:40,099 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:33:40,101 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:33:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:40,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 19:33:40,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:33:40,447 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:33:40,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:33:40,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112508710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:40,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:33:40,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-12 19:33:40,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940355665] [2024-10-12 19:33:40,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:40,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:33:40,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:40,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:33:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:33:40,492 INFO L87 Difference]: Start difference. First operand has 259 states, 203 states have (on average 1.6157635467980296) internal successors, (328), 205 states have internal predecessors, (328), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:40,608 INFO L93 Difference]: Finished difference Result 373 states and 571 transitions. [2024-10-12 19:33:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:33:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-10-12 19:33:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:40,622 INFO L225 Difference]: With dead ends: 373 [2024-10-12 19:33:40,622 INFO L226 Difference]: Without dead ends: 256 [2024-10-12 19:33:40,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:33:40,633 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:40,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:33:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-12 19:33:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-10-12 19:33:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 202 states have internal predecessors, (321), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-12 19:33:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 396 transitions. [2024-10-12 19:33:40,688 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 396 transitions. Word has length 79 [2024-10-12 19:33:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:40,690 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 396 transitions. [2024-10-12 19:33:40,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 396 transitions. [2024-10-12 19:33:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:33:40,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:40,695 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] [2024-10-12 19:33:40,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:33:40,895 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:33:40,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1144118604, now seen corresponding path program 1 times [2024-10-12 19:33:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:40,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659245943] [2024-10-12 19:33:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:33:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:33:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:33:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:33:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:33:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:33:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:33:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:33:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,233 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:33:41,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659245943] [2024-10-12 19:33:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659245943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:33:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948979965] [2024-10-12 19:33:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:41,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:41,238 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:33:41,240 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:33:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:41,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:33:41,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:33:41,545 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:33:41,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:33:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948979965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:33:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:33:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654750989] [2024-10-12 19:33:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:41,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:33:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:33:41,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:33:41,551 INFO L87 Difference]: Start difference. First operand 256 states and 396 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:41,624 INFO L93 Difference]: Finished difference Result 369 states and 558 transitions. [2024-10-12 19:33:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:33:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 80 [2024-10-12 19:33:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:41,627 INFO L225 Difference]: With dead ends: 369 [2024-10-12 19:33:41,627 INFO L226 Difference]: Without dead ends: 258 [2024-10-12 19:33:41,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:33:41,630 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:41,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 767 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:33:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-12 19:33:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-12 19:33:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.5911330049261083) internal successors, (323), 204 states have internal predecessors, (323), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-12 19:33:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 398 transitions. [2024-10-12 19:33:41,655 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 398 transitions. Word has length 80 [2024-10-12 19:33:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:41,656 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 398 transitions. [2024-10-12 19:33:41,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 398 transitions. [2024-10-12 19:33:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:33:41,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:41,664 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] [2024-10-12 19:33:41,677 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:33:41,864 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:33:41,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:41,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash -968189616, now seen corresponding path program 1 times [2024-10-12 19:33:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541625425] [2024-10-12 19:33:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:33:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:33:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:33:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:33:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:33:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:33:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:33:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:33:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,146 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:33:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541625425] [2024-10-12 19:33:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541625425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:33:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347380788] [2024-10-12 19:33:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:42,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:42,150 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:33:42,151 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:33:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:33:42,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:33:42,458 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:33:42,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:33:42,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347380788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:42,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:33:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:33:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570560904] [2024-10-12 19:33:42,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:42,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:33:42,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:42,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:33:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:33:42,467 INFO L87 Difference]: Start difference. First operand 258 states and 398 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:42,528 INFO L93 Difference]: Finished difference Result 546 states and 855 transitions. [2024-10-12 19:33:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:33:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 87 [2024-10-12 19:33:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:42,532 INFO L225 Difference]: With dead ends: 546 [2024-10-12 19:33:42,532 INFO L226 Difference]: Without dead ends: 310 [2024-10-12 19:33:42,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:33:42,539 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 102 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:42,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 725 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:33:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-12 19:33:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2024-10-12 19:33:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 239 states have (on average 1.602510460251046) internal successors, (383), 240 states have internal predecessors, (383), 49 states have call successors, (49), 16 states have call predecessors, (49), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-12 19:33:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 480 transitions. [2024-10-12 19:33:42,564 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 480 transitions. Word has length 87 [2024-10-12 19:33:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:42,564 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 480 transitions. [2024-10-12 19:33:42,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 480 transitions. [2024-10-12 19:33:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 19:33:42,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:42,567 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] [2024-10-12 19:33:42,586 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:33:42,768 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:33:42,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:42,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash -713025711, now seen corresponding path program 1 times [2024-10-12 19:33:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042021300] [2024-10-12 19:33:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:33:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:33:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:33:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:33:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:33:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:33:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:33:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:33:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:42,981 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:33:42,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042021300] [2024-10-12 19:33:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042021300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:33:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923051278] [2024-10-12 19:33:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:42,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:42,984 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:33:42,985 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:33:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:33:43,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:33:43,328 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:33:43,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:33:43,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923051278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:43,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:33:43,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-12 19:33:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540276897] [2024-10-12 19:33:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:43,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:33:43,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:43,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:33:43,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:33:43,330 INFO L87 Difference]: Start difference. First operand 305 states and 480 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:43,430 INFO L93 Difference]: Finished difference Result 605 states and 954 transitions. [2024-10-12 19:33:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:33:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 88 [2024-10-12 19:33:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:43,438 INFO L225 Difference]: With dead ends: 605 [2024-10-12 19:33:43,438 INFO L226 Difference]: Without dead ends: 307 [2024-10-12 19:33:43,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:33:43,442 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:43,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:33:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-12 19:33:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-12 19:33:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 240 states have (on average 1.6) internal successors, (384), 242 states have internal predecessors, (384), 49 states have call successors, (49), 16 states have call predecessors, (49), 17 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2024-10-12 19:33:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 483 transitions. [2024-10-12 19:33:43,465 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 483 transitions. Word has length 88 [2024-10-12 19:33:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:43,466 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 483 transitions. [2024-10-12 19:33:43,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 483 transitions. [2024-10-12 19:33:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:33:43,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:43,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] [2024-10-12 19:33:43,484 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:33:43,671 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:33:43,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -164249190, now seen corresponding path program 1 times [2024-10-12 19:33:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762151773] [2024-10-12 19:33:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:33:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:33:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:33:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:33:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:33:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:33:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:33:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:43,952 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:33:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:43,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762151773] [2024-10-12 19:33:43,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762151773] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:33:43,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543112588] [2024-10-12 19:33:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:43,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:43,955 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:33:43,959 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:33:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:33:44,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:33:44,295 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:33:44,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:33:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543112588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:33:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-12 19:33:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680078080] [2024-10-12 19:33:44,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:44,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:33:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:33:44,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:33:44,298 INFO L87 Difference]: Start difference. First operand 307 states and 483 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:44,398 INFO L93 Difference]: Finished difference Result 607 states and 959 transitions. [2024-10-12 19:33:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:33:44,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2024-10-12 19:33:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:44,402 INFO L225 Difference]: With dead ends: 607 [2024-10-12 19:33:44,402 INFO L226 Difference]: Without dead ends: 309 [2024-10-12 19:33:44,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:33:44,405 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:44,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1479 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:33:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-12 19:33:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-12 19:33:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 244 states have internal predecessors, (385), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-10-12 19:33:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 489 transitions. [2024-10-12 19:33:44,425 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 489 transitions. Word has length 89 [2024-10-12 19:33:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:44,425 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 489 transitions. [2024-10-12 19:33:44,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 489 transitions. [2024-10-12 19:33:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 19:33:44,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:44,429 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] [2024-10-12 19:33:44,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 19:33:44,632 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:33:44,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash -246379591, now seen corresponding path program 1 times [2024-10-12 19:33:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584082684] [2024-10-12 19:33:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:33:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:33:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:33:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:33:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:33:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:33:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:44,840 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:33:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584082684] [2024-10-12 19:33:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584082684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:33:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163926934] [2024-10-12 19:33:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:33:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:33:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:33:44,842 INFO L87 Difference]: Start difference. First operand 309 states and 489 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:46,357 INFO L93 Difference]: Finished difference Result 677 states and 1084 transitions. [2024-10-12 19:33:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:33:46,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2024-10-12 19:33:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:46,360 INFO L225 Difference]: With dead ends: 677 [2024-10-12 19:33:46,361 INFO L226 Difference]: Without dead ends: 387 [2024-10-12 19:33:46,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:33:46,364 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 826 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:46,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 968 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:33:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-12 19:33:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2024-10-12 19:33:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 244 states have internal predecessors, (385), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2024-10-12 19:33:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 488 transitions. [2024-10-12 19:33:46,402 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 488 transitions. Word has length 90 [2024-10-12 19:33:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:46,403 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 488 transitions. [2024-10-12 19:33:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 488 transitions. [2024-10-12 19:33:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 19:33:46,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:46,406 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] [2024-10-12 19:33:46,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:33:46,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 892234980, now seen corresponding path program 2 times [2024-10-12 19:33:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792691701] [2024-10-12 19:33:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:33:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:33:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:33:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:33:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:33:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:33:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:46,596 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:33:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792691701] [2024-10-12 19:33:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792691701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:46,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:33:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910572373] [2024-10-12 19:33:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:46,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:33:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:33:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:33:46,598 INFO L87 Difference]: Start difference. First operand 309 states and 488 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:48,109 INFO L93 Difference]: Finished difference Result 679 states and 1087 transitions. [2024-10-12 19:33:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:33:48,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-12 19:33:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:48,115 INFO L225 Difference]: With dead ends: 679 [2024-10-12 19:33:48,116 INFO L226 Difference]: Without dead ends: 389 [2024-10-12 19:33:48,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:33:48,118 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 822 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:48,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 968 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:33:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-12 19:33:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 311. [2024-10-12 19:33:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.5950413223140496) internal successors, (386), 246 states have internal predecessors, (386), 49 states have call successors, (49), 16 states have call predecessors, (49), 19 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2024-10-12 19:33:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 491 transitions. [2024-10-12 19:33:48,151 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 491 transitions. Word has length 91 [2024-10-12 19:33:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:48,151 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 491 transitions. [2024-10-12 19:33:48,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 491 transitions. [2024-10-12 19:33:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:33:48,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:48,153 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] [2024-10-12 19:33:48,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:33:48,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:48,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1960859148, now seen corresponding path program 1 times [2024-10-12 19:33:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:48,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693745671] [2024-10-12 19:33:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:33:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:33:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:33:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:33:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:33:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:48,396 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:33:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693745671] [2024-10-12 19:33:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693745671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:48,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:48,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:33:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047403270] [2024-10-12 19:33:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:48,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:33:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:33:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:33:48,399 INFO L87 Difference]: Start difference. First operand 311 states and 491 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-12 19:33:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:50,349 INFO L93 Difference]: Finished difference Result 677 states and 1082 transitions. [2024-10-12 19:33:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:33:50,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 92 [2024-10-12 19:33:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:50,352 INFO L225 Difference]: With dead ends: 677 [2024-10-12 19:33:50,352 INFO L226 Difference]: Without dead ends: 389 [2024-10-12 19:33:50,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:33:50,354 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 826 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:50,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1343 Invalid, 3201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:33:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-12 19:33:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 311. [2024-10-12 19:33:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.5950413223140496) internal successors, (386), 246 states have internal predecessors, (386), 49 states have call successors, (49), 16 states have call predecessors, (49), 19 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-10-12 19:33:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 490 transitions. [2024-10-12 19:33:50,378 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 490 transitions. Word has length 92 [2024-10-12 19:33:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:50,379 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 490 transitions. [2024-10-12 19:33:50,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-12 19:33:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 490 transitions. [2024-10-12 19:33:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 19:33:50,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:50,380 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] [2024-10-12 19:33:50,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:33:50,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:50,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash -532745963, now seen corresponding path program 2 times [2024-10-12 19:33:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439648893] [2024-10-12 19:33:50,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:33:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:33:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:33:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:33:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:33:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:50,596 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:33:50,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439648893] [2024-10-12 19:33:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439648893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:33:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66218195] [2024-10-12 19:33:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:33:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:33:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:33:50,599 INFO L87 Difference]: Start difference. First operand 311 states and 490 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-12 19:33:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:52,286 INFO L93 Difference]: Finished difference Result 679 states and 1088 transitions. [2024-10-12 19:33:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:33:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2024-10-12 19:33:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:52,289 INFO L225 Difference]: With dead ends: 679 [2024-10-12 19:33:52,290 INFO L226 Difference]: Without dead ends: 391 [2024-10-12 19:33:52,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:33:52,291 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 822 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:52,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1343 Invalid, 3209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:33:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-12 19:33:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 313. [2024-10-12 19:33:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.5925925925925926) internal successors, (387), 248 states have internal predecessors, (387), 49 states have call successors, (49), 16 states have call predecessors, (49), 20 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-12 19:33:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 496 transitions. [2024-10-12 19:33:52,314 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 496 transitions. Word has length 93 [2024-10-12 19:33:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:52,314 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 496 transitions. [2024-10-12 19:33:52,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-12 19:33:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 496 transitions. [2024-10-12 19:33:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:33:52,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:52,316 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] [2024-10-12 19:33:52,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:33:52,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash -439810963, now seen corresponding path program 1 times [2024-10-12 19:33:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863241301] [2024-10-12 19:33:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:33:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:33:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:33:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:33:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:33:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 19:33:52,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863241301] [2024-10-12 19:33:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863241301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:52,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:52,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:33:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331350578] [2024-10-12 19:33:52,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:52,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:33:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:33:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:33:52,504 INFO L87 Difference]: Start difference. First operand 313 states and 496 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:53,730 INFO L93 Difference]: Finished difference Result 681 states and 1091 transitions. [2024-10-12 19:33:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:33:53,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2024-10-12 19:33:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:53,733 INFO L225 Difference]: With dead ends: 681 [2024-10-12 19:33:53,733 INFO L226 Difference]: Without dead ends: 391 [2024-10-12 19:33:53,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:33:53,735 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 824 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:53,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 960 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:33:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-12 19:33:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 313. [2024-10-12 19:33:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.5925925925925926) internal successors, (387), 248 states have internal predecessors, (387), 49 states have call successors, (49), 16 states have call predecessors, (49), 20 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-12 19:33:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 496 transitions. [2024-10-12 19:33:53,782 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 496 transitions. Word has length 94 [2024-10-12 19:33:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:53,782 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 496 transitions. [2024-10-12 19:33:53,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:33:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 496 transitions. [2024-10-12 19:33:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:33:53,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:53,785 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] [2024-10-12 19:33:53,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:33:53,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1315829969, now seen corresponding path program 1 times [2024-10-12 19:33:53,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071339712] [2024-10-12 19:33:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:33:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:33:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:33:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:33:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:33:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-12 19:33:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071339712] [2024-10-12 19:33:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071339712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:33:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043586098] [2024-10-12 19:33:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:33:53,993 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:33:53,996 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:33:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:54,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:33:54,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:33:54,301 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:33:54,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:33:54,419 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:33:54,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043586098] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:33:54,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:33:54,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-12 19:33:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941092332] [2024-10-12 19:33:54,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:33:54,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 19:33:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 19:33:54,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:33:54,423 INFO L87 Difference]: Start difference. First operand 313 states and 496 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-12 19:33:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:56,765 INFO L93 Difference]: Finished difference Result 1008 states and 1698 transitions. [2024-10-12 19:33:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:33:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 94 [2024-10-12 19:33:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:56,773 INFO L225 Difference]: With dead ends: 1008 [2024-10-12 19:33:56,773 INFO L226 Difference]: Without dead ends: 721 [2024-10-12 19:33:56,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-12 19:33:56,777 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1747 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 3392 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 3904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 3392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:56,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 1526 Invalid, 3904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 3392 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:33:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-10-12 19:33:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 628. [2024-10-12 19:33:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 494 states have (on average 1.6295546558704452) internal successors, (805), 499 states have internal predecessors, (805), 113 states have call successors, (113), 16 states have call predecessors, (113), 20 states have return successors, (134), 112 states have call predecessors, (134), 112 states have call successors, (134) [2024-10-12 19:33:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1052 transitions. [2024-10-12 19:33:56,846 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1052 transitions. Word has length 94 [2024-10-12 19:33:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:56,848 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 1052 transitions. [2024-10-12 19:33:56,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-12 19:33:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1052 transitions. [2024-10-12 19:33:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 19:33:56,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:56,851 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] [2024-10-12 19:33:56,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 19:33:57,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:33:57,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:57,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1144601497, now seen corresponding path program 1 times [2024-10-12 19:33:57,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:57,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976700269] [2024-10-12 19:33:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:57,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:33:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:33:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:33:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:33:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:33:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:57,160 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:33:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976700269] [2024-10-12 19:33:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976700269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:57,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:57,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:33:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382232568] [2024-10-12 19:33:57,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:57,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:33:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:57,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:33:57,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:33:57,163 INFO L87 Difference]: Start difference. First operand 628 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:58,199 INFO L93 Difference]: Finished difference Result 1563 states and 2687 transitions. [2024-10-12 19:33:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:33:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-12 19:33:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:58,206 INFO L225 Difference]: With dead ends: 1563 [2024-10-12 19:33:58,207 INFO L226 Difference]: Without dead ends: 1003 [2024-10-12 19:33:58,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:33:58,210 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 920 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:58,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 710 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:33:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-10-12 19:33:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 920. [2024-10-12 19:33:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 722 states have (on average 1.6371191135734071) internal successors, (1182), 727 states have internal predecessors, (1182), 177 states have call successors, (177), 16 states have call predecessors, (177), 20 states have return successors, (208), 176 states have call predecessors, (208), 176 states have call successors, (208) [2024-10-12 19:33:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1567 transitions. [2024-10-12 19:33:58,278 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1567 transitions. Word has length 98 [2024-10-12 19:33:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1567 transitions. [2024-10-12 19:33:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1567 transitions. [2024-10-12 19:33:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 19:33:58,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:58,283 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] [2024-10-12 19:33:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:33:58,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 720630119, now seen corresponding path program 1 times [2024-10-12 19:33:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064349513] [2024-10-12 19:33:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:33:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:33:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:33:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:33:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:33:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:58,392 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:33:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064349513] [2024-10-12 19:33:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064349513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:33:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837068550] [2024-10-12 19:33:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:33:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:33:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:33:58,393 INFO L87 Difference]: Start difference. First operand 920 states and 1567 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:33:59,541 INFO L93 Difference]: Finished difference Result 2280 states and 3944 transitions. [2024-10-12 19:33:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:33:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-12 19:33:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:33:59,549 INFO L225 Difference]: With dead ends: 2280 [2024-10-12 19:33:59,550 INFO L226 Difference]: Without dead ends: 1478 [2024-10-12 19:33:59,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:33:59,553 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 918 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:33:59,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 705 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:33:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-10-12 19:33:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1395. [2024-10-12 19:33:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1102 states have (on average 1.6388384754990926) internal successors, (1806), 1107 states have internal predecessors, (1806), 272 states have call successors, (272), 16 states have call predecessors, (272), 20 states have return successors, (303), 271 states have call predecessors, (303), 271 states have call successors, (303) [2024-10-12 19:33:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2381 transitions. [2024-10-12 19:33:59,619 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2381 transitions. Word has length 99 [2024-10-12 19:33:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:33:59,619 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2381 transitions. [2024-10-12 19:33:59,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:33:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2381 transitions. [2024-10-12 19:33:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 19:33:59,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:33:59,625 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] [2024-10-12 19:33:59,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:33:59,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:33:59,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:33:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1582669223, now seen corresponding path program 1 times [2024-10-12 19:33:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:33:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859178203] [2024-10-12 19:33:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:33:59,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:33:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:33:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:33:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:33:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:33:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:33:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:33:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:33:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:33:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:33:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:33:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:33:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:33:59,761 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:33:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:33:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859178203] [2024-10-12 19:33:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859178203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:33:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:33:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:33:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011578367] [2024-10-12 19:33:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:33:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:33:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:33:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:33:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:33:59,763 INFO L87 Difference]: Start difference. First operand 1395 states and 2381 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:00,775 INFO L93 Difference]: Finished difference Result 3342 states and 5822 transitions. [2024-10-12 19:34:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:00,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-12 19:34:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:00,788 INFO L225 Difference]: With dead ends: 3342 [2024-10-12 19:34:00,789 INFO L226 Difference]: Without dead ends: 2193 [2024-10-12 19:34:00,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:00,794 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 916 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:00,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 701 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:34:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2024-10-12 19:34:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2110. [2024-10-12 19:34:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 1694 states have (on average 1.641086186540732) internal successors, (2780), 1699 states have internal predecessors, (2780), 395 states have call successors, (395), 16 states have call predecessors, (395), 20 states have return successors, (442), 394 states have call predecessors, (442), 394 states have call successors, (442) [2024-10-12 19:34:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3617 transitions. [2024-10-12 19:34:00,895 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3617 transitions. Word has length 100 [2024-10-12 19:34:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:00,895 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 3617 transitions. [2024-10-12 19:34:00,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3617 transitions. [2024-10-12 19:34:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:34:00,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:00,902 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] [2024-10-12 19:34:00,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:34:00,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1284537498, now seen corresponding path program 1 times [2024-10-12 19:34:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049562124] [2024-10-12 19:34:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:34:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:34:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:34:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:34:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:34:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:00,994 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:34:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049562124] [2024-10-12 19:34:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049562124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:00,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145729391] [2024-10-12 19:34:00,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:00,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:00,997 INFO L87 Difference]: Start difference. First operand 2110 states and 3617 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:02,149 INFO L93 Difference]: Finished difference Result 4984 states and 8735 transitions. [2024-10-12 19:34:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:02,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-12 19:34:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:02,169 INFO L225 Difference]: With dead ends: 4984 [2024-10-12 19:34:02,169 INFO L226 Difference]: Without dead ends: 3329 [2024-10-12 19:34:02,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:02,179 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 914 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:02,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 701 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:34:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2024-10-12 19:34:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3246. [2024-10-12 19:34:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 2651 states have (on average 1.6423990946812523) internal successors, (4354), 2656 states have internal predecessors, (4354), 574 states have call successors, (574), 16 states have call predecessors, (574), 20 states have return successors, (647), 573 states have call predecessors, (647), 573 states have call successors, (647) [2024-10-12 19:34:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5575 transitions. [2024-10-12 19:34:02,374 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5575 transitions. Word has length 101 [2024-10-12 19:34:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:02,375 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 5575 transitions. [2024-10-12 19:34:02,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5575 transitions. [2024-10-12 19:34:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 19:34:02,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:02,383 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] [2024-10-12 19:34:02,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:34:02,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:02,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash 133229149, now seen corresponding path program 1 times [2024-10-12 19:34:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723023920] [2024-10-12 19:34:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:34:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:34:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:34:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:34:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:34:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:02,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:34:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723023920] [2024-10-12 19:34:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723023920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:02,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462133633] [2024-10-12 19:34:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:02,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:02,482 INFO L87 Difference]: Start difference. First operand 3246 states and 5575 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:03,663 INFO L93 Difference]: Finished difference Result 7939 states and 13933 transitions. [2024-10-12 19:34:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-12 19:34:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:03,698 INFO L225 Difference]: With dead ends: 7939 [2024-10-12 19:34:03,698 INFO L226 Difference]: Without dead ends: 5387 [2024-10-12 19:34:03,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:03,710 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 912 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:03,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 736 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:34:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2024-10-12 19:34:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5304. [2024-10-12 19:34:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 4333 states have (on average 1.6332794830371566) internal successors, (7077), 4338 states have internal predecessors, (7077), 950 states have call successors, (950), 16 states have call predecessors, (950), 20 states have return successors, (1067), 949 states have call predecessors, (1067), 949 states have call successors, (1067) [2024-10-12 19:34:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 9094 transitions. [2024-10-12 19:34:03,954 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 9094 transitions. Word has length 102 [2024-10-12 19:34:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:03,955 INFO L471 AbstractCegarLoop]: Abstraction has 5304 states and 9094 transitions. [2024-10-12 19:34:03,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 9094 transitions. [2024-10-12 19:34:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:34:03,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:03,965 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] [2024-10-12 19:34:03,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:34:03,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:03,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1990303586, now seen corresponding path program 1 times [2024-10-12 19:34:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814595574] [2024-10-12 19:34:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:34:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:34:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:34:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:34:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:34:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:04,097 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:34:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814595574] [2024-10-12 19:34:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814595574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359692324] [2024-10-12 19:34:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:04,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:04,099 INFO L87 Difference]: Start difference. First operand 5304 states and 9094 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:05,307 INFO L93 Difference]: Finished difference Result 13144 states and 23017 transitions. [2024-10-12 19:34:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-12 19:34:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:05,369 INFO L225 Difference]: With dead ends: 13144 [2024-10-12 19:34:05,370 INFO L226 Difference]: Without dead ends: 8920 [2024-10-12 19:34:05,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:05,388 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 910 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:05,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 711 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:34:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2024-10-12 19:34:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8837. [2024-10-12 19:34:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 7260 states have (on average 1.6300275482093665) internal successors, (11834), 7265 states have internal predecessors, (11834), 1556 states have call successors, (1556), 16 states have call predecessors, (1556), 20 states have return successors, (1751), 1555 states have call predecessors, (1751), 1555 states have call successors, (1751) [2024-10-12 19:34:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 15141 transitions. [2024-10-12 19:34:05,813 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 15141 transitions. Word has length 103 [2024-10-12 19:34:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 8837 states and 15141 transitions. [2024-10-12 19:34:05,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 15141 transitions. [2024-10-12 19:34:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 19:34:05,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:05,828 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] [2024-10-12 19:34:05,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:34:05,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:05,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash -868526885, now seen corresponding path program 1 times [2024-10-12 19:34:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:05,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517158896] [2024-10-12 19:34:05,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:34:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:34:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:34:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:34:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:34:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:05,931 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:34:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517158896] [2024-10-12 19:34:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517158896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:05,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909692990] [2024-10-12 19:34:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:05,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:05,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:05,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:05,935 INFO L87 Difference]: Start difference. First operand 8837 states and 15141 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:07,422 INFO L93 Difference]: Finished difference Result 22916 states and 40046 transitions. [2024-10-12 19:34:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-12 19:34:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:07,490 INFO L225 Difference]: With dead ends: 22916 [2024-10-12 19:34:07,490 INFO L226 Difference]: Without dead ends: 15592 [2024-10-12 19:34:07,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:07,518 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 908 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:07,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 739 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:34:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15592 states. [2024-10-12 19:34:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15592 to 15509. [2024-10-12 19:34:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15509 states, 12729 states have (on average 1.6201586927488412) internal successors, (20623), 12734 states have internal predecessors, (20623), 2759 states have call successors, (2759), 16 states have call predecessors, (2759), 20 states have return successors, (3098), 2758 states have call predecessors, (3098), 2758 states have call successors, (3098) [2024-10-12 19:34:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15509 states to 15509 states and 26480 transitions. [2024-10-12 19:34:08,204 INFO L78 Accepts]: Start accepts. Automaton has 15509 states and 26480 transitions. Word has length 104 [2024-10-12 19:34:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:08,204 INFO L471 AbstractCegarLoop]: Abstraction has 15509 states and 26480 transitions. [2024-10-12 19:34:08,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15509 states and 26480 transitions. [2024-10-12 19:34:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 19:34:08,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:08,222 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] [2024-10-12 19:34:08,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:34:08,223 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 328956353, now seen corresponding path program 1 times [2024-10-12 19:34:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019582868] [2024-10-12 19:34:08,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:34:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:34:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:34:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:34:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:34:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:08,328 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:34:08,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:08,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019582868] [2024-10-12 19:34:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019582868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:08,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656368266] [2024-10-12 19:34:08,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:08,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:08,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:08,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:08,331 INFO L87 Difference]: Start difference. First operand 15509 states and 26480 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:09,935 INFO L93 Difference]: Finished difference Result 41083 states and 71644 transitions. [2024-10-12 19:34:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-12 19:34:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:10,091 INFO L225 Difference]: With dead ends: 41083 [2024-10-12 19:34:10,091 INFO L226 Difference]: Without dead ends: 27707 [2024-10-12 19:34:10,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:10,154 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 906 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:10,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 702 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:34:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27707 states. [2024-10-12 19:34:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27707 to 27624. [2024-10-12 19:34:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27624 states, 22805 states have (on average 1.615873711905284) internal successors, (36850), 22810 states have internal predecessors, (36850), 4798 states have call successors, (4798), 16 states have call predecessors, (4798), 20 states have return successors, (5411), 4797 states have call predecessors, (5411), 4797 states have call successors, (5411) [2024-10-12 19:34:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27624 states to 27624 states and 47059 transitions. [2024-10-12 19:34:11,425 INFO L78 Accepts]: Start accepts. Automaton has 27624 states and 47059 transitions. Word has length 105 [2024-10-12 19:34:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 27624 states and 47059 transitions. [2024-10-12 19:34:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 27624 states and 47059 transitions. [2024-10-12 19:34:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 19:34:11,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:11,448 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] [2024-10-12 19:34:11,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:34:11,448 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:11,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash 838376185, now seen corresponding path program 1 times [2024-10-12 19:34:11,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:11,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451372596] [2024-10-12 19:34:11,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:34:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:34:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:34:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:34:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:34:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:11,560 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:34:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451372596] [2024-10-12 19:34:11,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451372596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:11,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:11,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577715505] [2024-10-12 19:34:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:11,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:11,563 INFO L87 Difference]: Start difference. First operand 27624 states and 47059 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:13,814 INFO L93 Difference]: Finished difference Result 75275 states and 130438 transitions. [2024-10-12 19:34:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:13,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-12 19:34:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:14,077 INFO L225 Difference]: With dead ends: 75275 [2024-10-12 19:34:14,077 INFO L226 Difference]: Without dead ends: 50531 [2024-10-12 19:34:14,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:14,347 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 904 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:14,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 705 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:34:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50531 states. [2024-10-12 19:34:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50531 to 50448. [2024-10-12 19:34:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50448 states, 41914 states have (on average 1.6103927088800878) internal successors, (67498), 41919 states have internal predecessors, (67498), 8513 states have call successors, (8513), 16 states have call predecessors, (8513), 20 states have return successors, (9658), 8512 states have call predecessors, (9658), 8512 states have call successors, (9658) [2024-10-12 19:34:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50448 states to 50448 states and 85669 transitions. [2024-10-12 19:34:16,902 INFO L78 Accepts]: Start accepts. Automaton has 50448 states and 85669 transitions. Word has length 106 [2024-10-12 19:34:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:16,903 INFO L471 AbstractCegarLoop]: Abstraction has 50448 states and 85669 transitions. [2024-10-12 19:34:16,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 50448 states and 85669 transitions. [2024-10-12 19:34:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:34:16,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:16,923 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] [2024-10-12 19:34:16,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:34:16,923 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1424611743, now seen corresponding path program 1 times [2024-10-12 19:34:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:16,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323556520] [2024-10-12 19:34:16,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:16,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:16,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:34:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:34:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:34:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:34:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:34:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:17,036 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:34:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323556520] [2024-10-12 19:34:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323556520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:17,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:34:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926396461] [2024-10-12 19:34:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:34:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:34:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:34:17,039 INFO L87 Difference]: Start difference. First operand 50448 states and 85669 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:20,106 INFO L93 Difference]: Finished difference Result 94022 states and 163344 transitions. [2024-10-12 19:34:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:34:20,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-12 19:34:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:20,567 INFO L225 Difference]: With dead ends: 94022 [2024-10-12 19:34:20,567 INFO L226 Difference]: Without dead ends: 93911 [2024-10-12 19:34:20,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:34:20,630 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 899 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:20,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 711 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:34:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93911 states. [2024-10-12 19:34:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93911 to 93828. [2024-10-12 19:34:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93828 states, 78495 states have (on average 1.6034906681954264) internal successors, (125866), 78500 states have internal predecessors, (125866), 15312 states have call successors, (15312), 16 states have call predecessors, (15312), 20 states have return successors, (17503), 15311 states have call predecessors, (17503), 15311 states have call successors, (17503) [2024-10-12 19:34:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93828 states to 93828 states and 158681 transitions. [2024-10-12 19:34:24,579 INFO L78 Accepts]: Start accepts. Automaton has 93828 states and 158681 transitions. Word has length 107 [2024-10-12 19:34:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:24,580 INFO L471 AbstractCegarLoop]: Abstraction has 93828 states and 158681 transitions. [2024-10-12 19:34:24,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-12 19:34:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 93828 states and 158681 transitions. [2024-10-12 19:34:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 19:34:24,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:34:24,606 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] [2024-10-12 19:34:24,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:34:24,606 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:34:24,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:34:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1117930214, now seen corresponding path program 1 times [2024-10-12 19:34:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:34:24,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19170568] [2024-10-12 19:34:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:34:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:34:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:34:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:34:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:34:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:34:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:34:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:34:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:34:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:34:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:34:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:34:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:34:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:34:25,408 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:34:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:34:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19170568] [2024-10-12 19:34:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19170568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:34:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:34:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:34:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187108385] [2024-10-12 19:34:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:34:25,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:34:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:34:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:34:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:34:25,411 INFO L87 Difference]: Start difference. First operand 93828 states and 158681 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-12 19:34:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:34:28,317 INFO L93 Difference]: Finished difference Result 93904 states and 162083 transitions. [2024-10-12 19:34:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:34:28,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-12 19:34:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:34:28,350 INFO L225 Difference]: With dead ends: 93904 [2024-10-12 19:34:28,351 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:34:28,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:34:28,633 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 813 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:34:28,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 968 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:34:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:34:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:34:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:34:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:34:28,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2024-10-12 19:34:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:34:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:34:28,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-12 19:34:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:34:28,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:34:28,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:34:28,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:34:28,675 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:34:28,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.